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.

Ex Input:
[[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]

Ex Output:
[76, -40, 87, 30, 27, 27, 51]


Ex Input:
[[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]

Ex Output:
[34, 17, 30, -1, 5, 37, 24, 81]


Ex Input:
[[4, -172, 63], [-165, -5, 58, -29, -166, 57], [-162, -171, 54, -15], [99, -121, -126, -181], [-2, -11, -163], [-158, -49, 37, -138, -1], [-61, -40, -79, -21]]

Ex Output:

[63, 58, 54, 99, -2, 37, -21]