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:
[[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

Ex Output:
[36, 40, 84]


Ex Input:
[[-139, -32, 70, -186, 5, -63, 13], [-134, 27, -18, -63, -138, -190], [-112, 47, -39, 42, 43, -110, -19], [69, -73, 48, -32], [93, -126], [12, -143, -114, -159, -190, -45, -171]]

Ex Output:

[70, 27, 47, 69, 93, 12]