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:
[[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]

Ex Output:
[100, -120, -94, 63, 50, -139, 80, 56, 88]


Ex Input:
[[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]

Ex Output:
[89, 85, 85, 1]


Ex Input:
[[-113, -110, -113], [-107, -94, 56, -166, -158], [48, 100, -132, -178], [62, -127, -119, -31]]

Ex Output:

[-110, 56, 100, 62]