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:
[[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:
[[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Ex Output:
[29, 63, 12, 34]


Ex Input:
[[4, -164, 31, 52, -50, -17], [-126, -37, -118], [75, 64, -52, 72], [-135, -138, -31, 76, -1, -19]]

Ex Output:

[52, -37, 75, 76]