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:
[[-4, -186, 89, 50, 100, 24], [-135, -17, -4, 79, -42, -145], [-196, -130], [82, 74], [-187, 7, -164, -163, -109], [90, 76, -16, 13, 6, 89], [-89, 46]]

Ex Output:
[100, 79, -130, 82, 7, 90, 46]


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:
[[-29, -148, 18], [-35, 42, 89, -110, -187, -30], [-152, 82, -187, -114], [92, -16, -193, 67, -71, 31], [-62, -127]]

Ex Output:

[18, 89, 82, 92, -62]