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:
[[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

Ex Output:
[53, 41, 80, 98, 91, 62]


Ex Input:
[[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]

Ex Output:
[-61, -151, 63, -48, 2, 66]


Ex Input:
[[-54, -195, -53, -164, -38], [20, -62, 38, 38, -131, -77], [-63, -64], [-187, -165, -86, -79, 17], [42, -111, -170, -53, -61, -46], [-170, 7, -177, -181, -45, -195]]

Ex Output:

[-38, 38, -63, 17, 42, 7]