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:
[[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

Ex Output:
[92, 46, 25, 19]


Ex Input:
[[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

Ex Output:
[84, 1, 35, -78, 24, 87]


Ex Input:
[[-137, 58, 32, 95], [-200, 76, -12, 22, -69], [95, -172, -119, -100], [-25, -137], [6, -109, 30], [48, 13, -170, -175, 64], [77, -118], [59, 79, 99], [-87, -154, -187, -192]]

Ex Output:

[95, 76, 95, -25, 30, 64, 77, 99, -87]