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:
[[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]

Ex Output:
[83, 96, -38, 74, 50, -73, 51, 85, -26]


Ex Input:
[[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

Ex Output:
[-55, 98, -27]


Ex Input:
[[5, -41, 87, -100, 66, -28], [-7, -133, -189, 72, -59], [-130, -133, -169, -85, -40, -62], [-68, 51, -188], [21, -4, -164, -54, -165, -71, 60], [-46, -185, -149, 75, -20, -80], [44, -85, -94]]

Ex Output:

[87, 72, -40, 51, 60, 75, 44]