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:
[[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]

Ex Output:
[95, 47, 66, 75, 33, 72, 9]


Ex Input:
[[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

Ex Output:
[-42, 88, 91, -13, 34]


Ex Input:
[[5, 21], [-107, -133, -159, 26, -21, -200], [-188, -44], [-74, -106, 71, -131, -121, -165], [81, 19, -153, -180, -8, 68, -58], [-113, -175, 65]]

Ex Output:

[21, 26, -44, 71, 81, 65]