diff --git a/ChangeLog.md b/ChangeLog.md
--- a/ChangeLog.md
+++ b/ChangeLog.md
@@ -42,3 +42,7 @@
 ## 0.2.3.0 -- 2019-11-08
 
 * Second version revised D. Added two new functions (mapI12 and mapI21), renamed the mapI3 to mapI22. 
+
+## 0.3.0.0 -- 2019-11-08
+
+* Third version. Added functions with intermediate Monads.
diff --git a/Data/List/InnToOut.hs b/Data/List/InnToOut.hs
--- a/Data/List/InnToOut.hs
+++ b/Data/List/InnToOut.hs
@@ -5,17 +5,23 @@
 --
 -- Maintainer  :  olexandr543@yahoo.com
 --
--- Various additional operations on lists.
+-- Various additional operations on lists. Some of them have additional intermediate Monads inside.
 --
 
 module Data.List.InnToOut 
   (
-    -- * Operation to apply a function that creates an inner list to an element of the outer list   
+    -- * Operations to apply a function that creates an inner list to an element of the outer list   
        mapI
        , mapI2
        , mapI22
        , mapI12
        , mapI21
+    -- * Operations to obtain intermediate Monads
+       , mapI22M
+       , mapI2M2
+       , mapI2M2M   
+       , mapI12M
+       , mapI2M1
   ) where
 
 -- | Function that applies additional function @f :: a -> [a]@ to @a@ if @p a = True@
@@ -34,15 +40,39 @@
 mapI22 p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
 {-#INLINE mapI22#-}
 
+-- | Variant of the function 'mapI22' in which the second intermediate result @c@ is in the @Monad m@.
+mapI22M :: Monad m => (a -> Bool) -> (a -> b) -> (b -> d) -> (a -> m c) -> (m c -> d) -> [a] -> [d]
+mapI22M p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
+{-#INLINE mapI22M#-}
+
+-- | Variant of the function 'mapI22' in which the first intermediate result @b@ is in the @Monad m@.
+mapI2M2 :: Monad m => (a -> Bool) -> (a -> m b) -> (m b -> d) -> (a -> c) -> (c -> d) -> [a] -> [d]
+mapI2M2 p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
+{-#INLINE mapI2M2#-}
+
+-- | Variant of the function 'mapI22' in which both the intermediate results @b@ and @c@ are in the Monads.
+mapI2M2M :: (Monad m0, Monad m) => (a -> Bool) -> (a -> m0 b) -> (m0 b -> d) -> (a -> m c) -> (m c -> d) -> [a] -> [d]
+mapI2M2M p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
+{-#INLINE mapI2M2M#-}
+
 -- | Function that can apply two different ways of computing something depending of the predicate value @p :: a -> Bool@ and the structure of transition the data for the @[a]@. 
 -- It is used if there are two ways to transform data and the first one consists of one function and another -- from two applied consequently ones. Similar to arrow techniques.
 mapI12 :: (a -> Bool) -> (a -> c) -> (a -> b) -> (b -> c) -> [a] -> [c]
 mapI12 p f g h = map (\x -> if p x then f x else h (g x)) 
 {-#INLINE mapI12#-}
 
+-- | Variant of the function 'mapI12' in which the second intermediate result @b@ is in the @Monad m@.
+mapI12M :: Monad m => (a -> Bool) -> (a -> c) -> (a -> m b) -> (m b -> c) -> [a] -> [c]
+mapI12M p f g h = map (\x -> if p x then f x else h (g x)) 
+{-#INLINE mapI12M#-}
+
 -- | Function that can apply two different ways of computing something depending of the predicate value @p :: a -> Bool@ and the structure of transition the data for the @[a]@. 
 -- It is used if there are two ways to transform data and the first one consists of two applied consequently functions and the second -- from one applied function. Similar to arrow techniques.
 mapI21 :: (a -> Bool) -> (a -> b) -> (b -> c) -> (a -> c) -> [a] -> [c]
 mapI21 p f g h = map (\x -> if p x then g (f x) else h x) 
 {-#INLINE mapI21#-}
 
+-- | Variant of the function 'mapI21' in which the first intermediate result @b@ is in the @Monad m@.
+mapI2M1 :: Monad m => (a -> Bool) -> (a -> m b) -> (m b -> c) -> (a -> c) -> [a] -> [c]
+mapI2M1 p f g h = map (\x -> if p x then g (f x) else h x) 
+{-#INLINE mapI2M1#-}
diff --git a/mmsyn5.cabal b/mmsyn5.cabal
--- a/mmsyn5.cabal
+++ b/mmsyn5.cabal
@@ -2,8 +2,8 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                mmsyn5
-version:             0.2.3.0
-synopsis:            Various additional operations on lists
+version:             0.3.0.0
+synopsis:            Various additional operations on lists (some with intermediate Monads)
 description:         A small library to deal with a little bit more complex operations on lists than Data.List module
 homepage:            http://hackage.haskell.org/package/mmsyn5
 license:             MIT