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]: [[97, -63, -64, -183, 95, -144], [-60, 44, -72, 31, -170, 88], [-127, 4, 73, -124, -186], [59, -117, -13, -186], [9, 39], [-174, 92, 4, -67, -112], [78, -107], [48, -75, 13, -184, -140, -104]]
[EX A]: [97, 88, 73, 59, 39, 92, 78, 48]

[EX Q]: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[EX A]: [60, -32, 68, 93, 24, 26, 7, 85]

[EX Q]: [[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]
[EX A]:
[78, 80, 91, 99]