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:
[[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

Ex Output:
[-163, 37, 98, 77, 58, 47]


Ex Input:
[[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]

Ex Output:
[4, 95, 28, 51, -75, 76, 64, 9]


Ex Input:
[[-19, -16, 2, -60, 17, 35], [-144, 29, 32, -175], [80, 86, -40, -179], [-171, -107, -173, -152, -124]]

Ex Output:

[35, 32, 86, -107]