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:
[[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

Ex Output:
[55, 21, 75, 84]


Ex Input:
[[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]

Ex Output:
[95, -53, 27]


Ex Input:
[[-88, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]

Ex Output:

[52, -25, 74, 91, 52, 98, -13, 95]