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]: [[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]
[EX A]: [-68, 43, 91, 96, 85, 80]

[EX Q]: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]
[EX A]: [78, -56, -80, 89, -112, 49, -93, 91, -94]

[EX Q]: [[46, 92, -32, -180, -1], [-76, 96, -102, -146, 77, -124, -162], [-74, -25], [-87, -138, -22, -25], [-64, -102, -157, 93, 70, -130], [16, 25, 83], [-108, -144, -123]]
[EX A]:
[92, 96, -25, -22, 93, 83, -108]