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.

Input: Consider Input: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]

Output: [95, 47, 66, 75, 33, 72, 9]


Input: Consider Input: [[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]

Output: [32, 26, 72, 53, 75, 58, 92, 44]


Input: Consider Input: [[-79, -57], [34, 25, -200, -91, -18, -116], [-150, -135], [1, 7, 70, 85, 38], [57, -159, 62, 63]]


Output: [-57, 34, -135, 85, 63]