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]: [[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]
[EX A]: [83, 96, -38, 74, 50, -73, 51, 85, -26]

[EX Q]: [[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]
[EX A]: [97, 23, -2, 61, 62, 68, 12, 15]

[EX Q]: [[31, -174, -190], [-193, 72], [-123, 60, 42]]
[EX A]:
[31, 72, 60]