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]: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
[EX A]: [86, 23, 78, 68, -116, 72, 55, 53]

[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]: [[87, -199], [-157, -85, 13, -172, -50, -165, 14], [-158, -112, -112, 11, 75, -12], [-140, -195, -92], [-101, 2, 93], [88, 95, 57, 86, -50, -53], [-148, -111, 1, -103, -143, -97, 83]]
[EX A]:
[87, 14, 75, -92, 93, 95, 83]