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:
[[-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:
[[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]

Ex Output:
[92, 50, -48, 70, 50, 30, 14, 7, 62]


Ex Input:
[[-51, -163, 14, 44, 30], [-96, 13, 15, 3, -192, -87, -178], [61, -91, -170, -27], [82, -73, -131, 24, -48, 91, 6], [45, -64, 79]]

Ex Output:

[44, 15, 61, 91, 79]