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:
[[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Ex Output:
[29, 63, 12, 34]


Ex Input:
[[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]

Ex Output:
[-139, 92, 69, 96]


Ex Input:
[[-167, 6, 96, -5, -29], [-56, -130, -21, 93], [-75, -153, 3, -47, 46], [-37, -90, -67], [-34, -189, -165, -127, 80, -37], [-67, -59, 99, 7, -19, -140]]

Ex Output:

[96, 93, 46, -37, 80, 99]