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:
[[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]]

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


Ex Input:
[[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]

Ex Output:
[-84, 64, 62, -1, 88, -71]


Ex Input:
[[-122, -11, -157, -127, 99], [-71, -88, -27, 93], [-11, -57, -11, 24, -30, -199], [33, -108, -22], [-79, -108, -196], [-22, -90], [-40, 70, -4, 36, -95, -84, -155], [-88, 94, -174, -183, -150, 77, 4], [87, 14, -7, 89, -77]]

Ex Output:

[99, 93, 24, 33, -79, -22, 70, 94, 89]