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.

[[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]
[77, 20, 78, 69, 77, 24, -5, 45]

[[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]

[[-198, 43], [28, 89, 59, 30], [-51, -136], [-37, -28, -169, -147, -123, 8, -25], [74, 19, -75, -164, -86, 61, -74], [72, -182, 2, -145, -60, 79, 86]]

[43, 89, -51, 8, 74, 86]