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:
[[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

Ex Output:
[2, 72, 60]


Ex Input:
[[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]

Ex Output:
[36, 86, 10, 81, 69, 41, 91, 34]


Ex Input:
[[92, 77, 42, -142, -58, -17], [-61, 98, -21, -65, -156, -95], [-86, -159, 29, 47, -106, -155, -27], [-56, -20, 47, 33, 8, -14], [-97, 37, -179, -180, -80, -129], [-167, 0, 96, -154, -72]]

Ex Output:

[92, 98, 47, 47, 37, 96]