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.

[[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
[70, -16, 51, 80, -45, -14, 84, 89, 49]

[[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]
[78, 70, 89, 9]

[[-112, -185, 83, -104], [75, -109], [-44, -147, 18, -36, -12, -98, 86], [-192, 90, -11, -68, -55, -176], [-64, 50, -56, 54, 14], [-112, -77], [-91, -114, 0, 9, -186, 0, 100], [-150, -67, -18, 44, -15, -61, 1]]

[83, 75, 86, 90, 54, -77, 100, 44]