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:
[[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]

Ex Output:
[63, -33, 43, 68]


Ex Input:
[[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

Ex Output:
[95, 60, 31, -122, 66, 84, 17]


Ex Input:
[[-162, -64], [-42, -32, 49], [-87, -107, 36, -134, -80, -199, 20], [59, 43, -181, -96, 100, -55, -172], [-71, -47, 19, -79, -184], [-2, 2, -151, -86, 63, 70], [-191, -119, -49, -186, -137]]

Ex Output:

[-64, 49, 36, 100, 19, 70, -49]