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:
[[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

Ex Output:
[98, 30, 96, 87, 96, 67, 53]


Ex Input:
[[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]

Ex Output:
[-30, 68, -15, 38]


Ex Input:
[[-97, 57, -197, -56, -128, -33], [-4, -136, 31, 11, -117], [-42, -41, -130, -169, -90], [-3, -115, 19, -29], [36, -134, -5, -50, -58, -148], [-175, -168, -186, -156, -112]]

Ex Output:

[57, 31, -41, 19, 36, -112]