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:
[[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

Ex Output:
[37, 32, 34, -3, 97, 97, 68]


Ex Input:
[[92, -175], [-99, -116]]

Ex Output:
[92, -99]


Ex Input:
[[25, -86, 15, -46, -149, -185], [-75, 93, -83, 30, -129, -110, 89], [-88, -63, -166, 28], [-155, -147, -26, -162], [34, -55, -35, -8, -154, -116]]

Ex Output:

[25, 93, 28, -26, 34]