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]: [[43, -158, 27, -169, -144, 35], [-73, -173]]
[EX A]: [43, -73]

[EX Q]: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
[EX A]: [52, 80, 98, 38, 69, 81, 8, 64]

[EX Q]: [[-55, -122, -112, -81], [-181, 46, -178, -147, -93], [-109, 2, -157, 18, -54, -180], [-72, -114, -175, 31, -71, 54], [-145, -50], [-187, -71, 35, -55]]
[EX A]:
[-55, 46, 18, 54, -50, 35]