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:
[[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

Ex Output:
[-6, 36, 29, -46, -41, 35]


Ex Input:
[[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]

Ex Output:
[90, 65, 16, 93, 30]


Ex Input:
[[-141, -59, -187, -89], [-175, 33, -137, 23], [-3, -74, -123, -57, -58]]

Ex Output:

[-59, 33, -3]