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: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]

Output: [78, 70, 89, 9]


Input: Consider Input: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]

Output: [27, -10, 40, 78, 74, 22, 51]


Input: Consider Input: [[-23, -44], [-151, 44, -125, -31, -175, 98, 73], [-134, -48, -191, -70], [4, 88]]


Output: [-23, 98, -48, 88]