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:
[[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]

Ex Output:
[81, 67, 86, 59, 75]


Ex Input:
[[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]

Ex Output:
[95, 58, 72, 99, 80, 89, -18, -25]


Ex Input:
[[49, 67, -181, 97], [64, -46], [-83, 41], [-194, -187, -6, -131, -128], [18, -38, 41, -52], [-11, -159, -36, -180, 91], [-80, -185, -198, -164, -173, 0], [62, 70, -125], [61, 86, -142, 38]]

Ex Output:

[97, 64, 41, -6, 41, 91, 0, 70, 86]