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:
[[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

Ex Output:
[1, 62, 100, 26, 85, 56, -9]


Ex Input:
[[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

Ex Output:
[95, 57, -144, 66, 54, 52, 93, 100, 21]


Ex Input:
[[-35, -98], [-49, -84, 51, -69, 9, -140], [-70, -92, -139, -8, 75], [-194, -178, 57, -183, -18], [-139, -82], [9, -14], [-176, -65, 69]]

Ex Output:

[-35, 51, 75, 57, -82, 9, 69]