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:
[[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]

Ex Output:
[16, 51, 99, 35]


Ex Input:
[[-148, 21, 53, -197, -63, -94, 15], [-116, -67, 27, -103, 7, 24], [-133, 24, -155, -139, 66, -188, 34], [-9, -112], [-1, -91, -163, 78, 52, -143, -59], [-75, 17, -177, 72, -169]]

Ex Output:

[53, 27, 66, -9, 78, 72]