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:
[[-132, 87, 9, -146, -184], [97, -169, -21, 52, 16, -182, -6], [-60, -2, -147, 55], [-111, -154, -41, 37, -97, -139, -111], [33, -113, -106, -92], [-13, 49, 66, -121, 61, -129, -124], [72, -107, -192, 86]]

Ex Output:
[87, 97, 55, 37, 33, 66, 86]


Ex Input:
[[-49, 21, 46, -172], [0, 16], [-20, -167, -72, -79, -24, -26, 71], [-68, 0, 97], [26, -30], [-64, -151, -129, -153, 44, 18, -29], [60, -72, 28, 97, -109]]

Ex Output:

[46, 16, 71, 97, 26, 44, 97]