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:
[[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]

Ex Output:
[-2, 73, 94, 81]


Ex Input:
[[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]

Ex Output:
[44, -43, 93, 23, 9]


Ex Input:
[[-85, 87, 65, -189, -101], [-83, -34, -66, -166, -122, -148], [-2, -40], [-48, -117], [25, 39, 43, 74], [-83, -149], [51, -133, 50, -25]]

Ex Output:

[87, -34, -2, -48, 74, -83, 51]