I refuse to use a burrito. Just one example and one rule.
You have three functions that can fail:
parseAge :: String -> Maybe Int
checkAdult :: Int -> Maybe Int
describe :: Int -> Maybe String
Without any abstraction, chaining them looks like this:
case parseAge s of
Nothing -> Nothing
Just a -> case checkAdult a of
Nothing -> Nothing
Just b -> describe b
The same pattern, "if it failed, stop; otherwise pass the value on", repeats at every step. >>= is that pattern, written once:
parseAge s >>= checkAdult >>= describe
And do notation is the same thing with nicer clothes:
do a <- parseAge s
b <- checkAdult a
describe b
A monad is a type with a way to say "put a plain value inside" (return) and a way to say "run the next step if there is a value" (>>=). For Maybe the "next step" is skipped on Nothing. For lists it runs once per element. For IO it runs after the previous action. Same shape, different meaning of "next".
That is all of it. The other 47 tutorials were mostly about the burrito.