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³)?

>>23
((a,b),c) ≠ (a,b,c)
also,
filter (uncurry (==) . (uncurry (+) . join (***) (^2) *** (^2))) $ (join $ join $ liftA3 (((,).).(,))) [1..10]
doesn't use that `on` bullshit.

and then there's this:
filter (\(a,b,c) -> a^2 + b^2 == c^2) $ (join $ join $ liftA3 (,,)) [1..10]