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]: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]
[EX A]: [95, 63, 85, -7, 74, 40, 83, 80, 70]

[EX Q]: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]
[EX A]: [60, -36, 94, 68, 36, -64, 41]

[EX Q]: [[-18, -117, -48], [72, -30, -20], [-50, -116, -119], [15, -21], [12, 59, 80, -142], [-30, 77, 61, 70, -107], [-104, 23, 41]]
[EX A]:
[-18, 72, -50, 15, 80, 77, 41]