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 Q]: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[EX A]: [95, 47, 66, 75, 33, 72, 9]

[EX Q]: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
[EX A]: [90, 65, 16, 93, 30]

[EX Q]: [[-48, -183], [-156, -86, -42, 81, 43, -21], [-124, 89, -90, -108, -5], [68, 16, 89, 60, -139, -58]]
[EX A]:
[-48, 81, 89, 89]