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:
[[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]

Ex Output:
[75, 5, 96, 58, 93, -49, -5, 82, 92]


Ex Input:
[[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]

Ex Output:
[44, -43, 93, 23, 9]


Ex Input:
[[-115, -149, 39, -131, 8, -200, -47], [-144, 32, -110, -135, 4, -190], [-71, -169, -116, -51, -120, -2, 61], [57, -178, 83, -137, -139, -63], [12, -100, -24, -159], [70, -195, -44], [55, 13, -71, 21], [0, 54, -26, -120]]

Ex Output:

[39, 32, 61, 83, 12, 70, 55, 54]