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:
[[-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:
[[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

Ex Output:
[84, 1, 35, -78, 24, 87]


Ex Input:
[[-24, 66, -115, -170, -167, -118, -31], [91, -113, -146], [-150, 42], [-64, -194, -151, 84, -156, 30]]

Ex Output:

[66, 91, 42, 84]