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:
[[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]

Ex Output:
[100, 3, 97]


Ex Input:
[[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]

Ex Output:
[94, 79, 53, 51, 84, -33]


Ex Input:
[[-195, -186, -51], [-164, 86, 87, 16], [-159, -186], [57, -186, -129, 99, -165, -7, -81]]

Ex Output:

[-51, 87, -159, 99]