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:
[[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]

Ex Output:
[98, 79, 97, 65, 71, 43, -72]


Ex Input:
[[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

Ex Output:
[-18, 95, 50, 81, 49, 91, 94, 59]


Ex Input:
[[-169, -29, -151, -64, -172, -110], [-198, -97, -46, 48], [-109, -158, -47]]

Ex Output:

[-29, 48, -47]