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:
[[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]

Ex Output:
[79, 65, -87, 89, -2, -13, 20, -184]


Ex Input:
[[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

Ex Output:
[65, 53, 72, -30, 85, 38]


Ex Input:
[[-46, 45, -126, -71, -82, -79], [-15, 0, -95, 20, 83, -181, 41], [-90, -157, -176]]

Ex Output:

[45, 83, -90]