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:
[[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

Ex Output:
[18, 84, -83, 96, -52, 90, 76]


Ex Input:
[[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

Ex Output:
[58, 54, 100, 65]


Ex Input:
[[98, 58, -48, 92, 93, -144, -176], [-76, -127, 99, -170]]

Ex Output:

[98, 99]