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:
[[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]

Ex Output:
[84, 66, 12, 62, 32]


Ex Input:
[[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

Ex Output:
[18, 79, 47, 72]


Ex Input:
[[-81, 58], [-163, -168, -123, 74, -61, 11, -83], [-107, -178, -46], [-11, 62, -70, -46], [92, 87, 51, -18, 80, -69], [59, -66, -152, 35, -186, -85], [65, -101, -42, -64, -9, -181], [-8, -193, -96, -150]]

Ex Output:

[58, 74, -46, 62, 92, 59, 65, -8]