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]: [[-56, 84, -91, -184, 7, 29, -135], [48, 90, 33], [46, 91, -59], [3, -92, -89, -112, -125, -169]]
[EX A]: [84, 90, 91, 3]

[EX Q]: [[-75, 10, -138, -42, 85, 8, -74], [18, 10, -70, 74, -88, -117, -145], [65, -145, 24, -193, -120, -186, -14], [-172, -115, -146], [-87, -180, -38, 77], [91, -50, -12, -23, -38, -89, 71], [-58, 81, -175], [-197, -145, 57, 94, -78, -184, -133], [-50, -183, -127, -77, 41]]
[EX A]: [85, 74, 65, -115, 77, 91, 81, 94, 41]

[EX Q]: [[-128, 70, -62], [6, -141, -141], [-155, -36, 30, 43, -11, 34, -147], [-173, -11, -86], [-1, -63], [-149, -155, -163, -12, -21], [-189, -193, -90, 33], [-20, -41, 16, -197, -61, -157], [-55, 77, -9, -173, -80, -148, 81]]
[EX A]:
[70, 6, 43, -11, -1, -12, 33, 16, 81]