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:
[[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]

Ex Output:
[77, 20, 78, 69, 77, 24, -5, 45]


Ex Input:
[[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]

Ex Output:
[98, 72, 48]


Ex Input:
[[-131, -75, -198], [-85, -24, 84, -141, 45], [-61, -148, -72, -18], [-129, -93, -197, -147, 61], [-108, -97, -46]]

Ex Output:

[-75, 84, -18, 61, -46]