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:
[[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]

Ex Output:
[97, 23]


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:
[[-156, -2], [-2, 29, 61, 13, 72, 6], [-43, -129, 71], [-17, 18, -130, -6, -186, 15, -68], [0, -23, -27]]

Ex Output:

[-2, 72, 71, 18, 0]