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:
[[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]

Ex Output:
[17, 69, 96, 75, 36, -151]


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:
[[90, 68, -61, -120], [-34, -30, -25, -132, -92, -170], [54, -10, -6, -11, -65, -181, 96], [-18, -97, -121], [-62, -61, 90, 96, 83, -126, 54], [-77, -189, -146], [-23, -75], [-28, 47, -171, -150, 39]]

Ex Output:

[90, -25, 96, -18, 96, -77, -23, 47]