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]: [[-38, -147, 7, 87, 35, -6, -90], [-83, 85, -60, -52, 8, -114, -191]]
[EX A]: [87, 85]

[EX Q]: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]
[EX A]: [18, 84, -83, 96, -52, 90, 76]

[EX Q]: [[-63, 1, -174, -196, 28, 42], [-157, -170, 27, -190], [-7, 32, -120, -91, -28, -3, 8], [-21, -43, -194, -186], [-79, -158, -185], [-92, -185, -99]]
[EX A]:
[42, 27, 32, -21, -79, -92]