Haskell list comprehensions

Is there something deeper to it, or is it just a shitty excuse for not writing, e.g. three for loops in [(a, b, c) | a <- [1..10], b <- [1..10], c <- [1..10], a^2 + b^2 == c^2]
and it still being O(n³)?

>>20
catMaybes $ liftM3 (flip flip Nothing . (flip .) . ap (ap . (liftM2 if' .) . flip flip (^2) . (((.) . (==)) .) . (. (^2)) . (+) . (^2)) (((Just .) .) . (,,))) [1..10] [1..10] [1..10]