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]: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]
[EX A]: [65, 53, 72, -30, 85, 38]

[EX Q]: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]
[EX A]: [-122, 85, 30, 49, -75, 68, 72]

[EX Q]: [[-94, -7, 31, 13, 76, -173, -192], [-126, -126, 94, -135, -70, 76]]
[EX A]:
[76, 94]