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:
[[44, 37, -10, 4, -109, 87], [-62, -48, 51, -171, -162], [-41, 10, -49, -32, -116], [89, 100, -192, -33, -41, -17, -19], [86, 16], [-92, -131, 2, -25, 10, -84, -124], [-119, 77], [58, 23], [-103, -64, -166, 74]]

Ex Output:
[87, 51, 10, 100, 86, 10, 77, 58, 74]


Ex Input:
[[-195, 0], [42, 19, -7], [-155, -76, -83], [-144, 19, 88], [-139, -174, -137, 59]]

Ex Output:
[0, 42, -76, 88, 59]


Ex Input:
[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

Ex Output:

[96, 48, 65, 19, -26, 95, -11]