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:
[[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]

Ex Output:
[86, 76, -100, 99, 27, -48]


Ex Input:
[[49, -37, -159, 52, -39, 6], [-96, -7, -2, -115, -154, -31, -44], [-71, 93, -73, -75], [-21, 91, 37], [-86, -80, -9, -159, -98, 92, -121], [-46, -98, 5, -175, -101, 22, -71], [-9, -10]]

Ex Output:

[52, -2, 93, 91, 92, 22, -9]