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:
[[6, -22, -195, 87], [-198, 60, 87, 19, 98, -147, 94], [-62, 50], [-159, -118, -193], [-165, -176, -157, -43, -121, -73], [32, 51, -24, -37, 80], [-110, -100, -198, -145]]

Ex Output:
[87, 98, 50, -118, -43, 80, -100]


Ex Input:
[[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

Ex Output:
[31, -1, 65, -15, -38, 59, -23]


Ex Input:
[[-24, -161, -180, 51, -95], [41, -95, -198, -113, -166, -145], [-69, -125, 65, -187], [11, -80, -180, -18]]

Ex Output:

[51, 41, 65, 11]