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:
[[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]

Ex Output:
[-121, 80, 98, 56, -17, 10, 55]


Ex Input:
[[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]

Ex Output:
[-42, 39, 83, 62, 10, 55]


Ex Input:
[[61, -21], [-22, -125, -185, 46, 60, -2, 54], [-179, -113, -46, -110, -92, -41, 61], [-56, -175, -116, -102, -48, -147, 28], [82, 21, -148, -198]]

Ex Output:

[61, 60, 61, 28, 82]