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:
[[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:
[[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

Ex Output:
[36, 40, 84]


Ex Input:
[[-103, -85], [-132, -37, 95], [93, 4, -111, -7, 33, -131], [72, 64, 76, -79], [87, 85, -94, 94, -79, 29, 40], [-193, -147, 43, -31, -20], [96, -71, -81, 27, -81], [-199, 83, -7, -127, -131, -35, -185]]

Ex Output:

[-85, 95, 93, 76, 94, 43, 96, 83]


