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:
[[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]

Ex Output:
[0, -131, 75, 100, 90, 95, -24, 13, 10]


Ex Input:
[[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]

Ex Output:
[91, 3, 49, 70, 91]


Ex Input:
[[49, -130, -143, 22, -144, -179], [-198, 3, -41, -98, -200, -124, -66], [41, -48, -145, 87, 26], [-173, -106], [-12, -175], [40, -108, 97, -158, -152, -171], [-158, -157, 60, -156, -163]]

Ex Output:

[49, 3, 87, -106, -12, 97, 60]