In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

[[42, -42, -94, 25, -125], [-141, -138, -170, -87, -121]]
[42, -87]

[[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]
[23, 99, 54, 29, 98, 95, 65, 88, 51]

[[32, 43, -104, 89, -47], [-111, 16], [-39, -134, -137, -100, 71], [4, -145, 15, -69], [-49, 23, 85, -124], [-127, -71, 83, 94, -34, -20], [-198, -46, -101]]

[89, 16, 71, 15, 85, 94, -46]