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:
[[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]

Ex Output:
[93, 7, 60]


Ex Input:
[[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]

Ex Output:
[-59, 78, 25, 94, 91]


Ex Input:
[[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]

Ex Output:

[75, 70, 47, 87, 37, 72, -12, -5, 76]