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, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]

Ex Output:
[98, 79, 97, 65, 71, 43, -72]


Ex Input:
[[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]

Ex Output:
[96, 94]


Ex Input:
[[71, 77, -141, 92, 96, -32, 41], [82, 39], [-179, 51, -148], [90, -143, 51, -10, 58]]

Ex Output:

[96, 82, 51, 90]