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:
[[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

Ex Output:
[67, 90]


Ex Input:
[[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]

Ex Output:
[75, 70, 47, 87, 37, 72, -12, -5, 76]


Ex Input:
[[-126, -116], [-172, -198, -128, 49, -90], [-29, -5, -50, -184, 29, -179], [-120, -84, -65, -167, -3, -3, -138], [-99, -129, 41, -192, -45], [-106, 41, -139, -145, -119], [67, 54, -43, -45], [0, 67]]

Ex Output:

[-116, 49, 29, -3, 41, 41, 67, 67]