foldM -is:exact -is:exact

foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
base Control.Monad
The foldM function is analogous to foldl, except that its result is encapsulated in a monad. Note that foldM works from left-to-right over the list arguments. This could be an issue where (>>) and the `folded function' are not commutative. 
foldM f a1 [x1, x2, ..., xm]

==

do
a2 <- f a1 x1
a3 <- f a2 x2
...
f am xm
If right-to-left evaluation is required, the input list should be reversed. Note: foldM is the same as foldlM
foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
base Prelude Data.Foldable
Map each element of the structure to a monoid, and combine the results.
foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
base Control.Monad
Like foldM, but discards the result.
foldMapDefault :: forall t m a . (Traversable t, Monoid m) => (a -> m) -> t a -> m
base Data.Traversable
This function may be used as a value for foldMap in a Foldable instance. 
foldMapDefault f ≡ getConst . traverse (Const . f)
bifoldMap :: (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m
base Data.Bifoldable
Combines the elements of a structure, given ways of mapping them to a common monoid. 
bifoldMap f g
≡ bifoldr (mappend . f) (mappend . g) mempty
bifoldMapDefault :: forall t m a b . (Bitraversable t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m
base Data.Bitraversable
A default definition of bifoldMap in terms of the Bitraversable operations. 
bifoldMapDefault f g ≡
getConst . bitraverse (Const . f) (Const . g)