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:
[[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]

Ex Output:
[34, 17, 30, -1, 5, 37, 24, 81]


Ex Input:
[[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]

Ex Output:
[80, 88, 84, 99, 34]


Ex Input:
[[-41, -47, -32, -125, -25, -52, 43], [-86, 93, -35, 81, -169, -117, -110], [-2, 61, -174], [-32, -92, 88, 63, 29, 98], [-45, -10, 80, -119, 54, -12, 0], [62, 87, 84, -53]]

Ex Output:

[43, 93, 61, 98, 80, 87]