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]: [[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]
[EX A]: [79, 24, 65, 25, 84]

[EX Q]: [[65, -76, 89, 17, -27, -124, -120], [-23, -180, -165, -147], [94, 55, 56, -1, -200, -162], [-187, -37]]
[EX A]:
[89, -23, 94, -37]