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:
[[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

Ex Output:
[18, 84, -83, 96, -52, 90, 76]


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:
[[36, -71, 77, -131, -177, 96, -132], [-45, 66, 95, 7], [-190, 36, -42], [-41, 79, -101, -123, -147, -118, -125], [45, -151, 93, -192, 0], [-42, -200, 98]]

Ex Output:

[96, 95, 36, 79, 93, 98]