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:
[[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

Ex Output:
[25, 59, -59, 90, 68, -84]


Ex Input:
[[-3, -50, 28, 67, -12, 97, -98], [41, 88, 81], [44, -50, -49, -132, -161, 26]]

Ex Output:
[97, 88, 44]


Ex Input:
[[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

Ex Output:

[93, -100, 50, 56, 90, -87, 74, 82, 49]