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:
[[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]

Ex Output:
[17, 85, 20, 70, 12, 73, 90, 59, 58]


Ex Input:
[[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

Ex Output:
[-93, 50, 32]


Ex Input:
[[100, -70, -161], [-8, 15, -200, -165, -64, -186], [-154, -124, 64, 89, -183]]

Ex Output:

[100, 15, 89]