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]: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]
[EX A]: [35, -69, -81, 92, 91, 58, 48, -41]

[EX Q]: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]
[EX A]: [9, -5, 62, -35, 92, -30, 91]

[EX Q]: [[-6, -8], [74, 65, -14, -51, 30, 47], [-88, -159, -70], [-29, 74, 82, -165, -195, -9, -66], [-122, 66, -97, -2, -191, -112]]
[EX A]:
[-6, 74, -70, 82, 66]