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]: [[-95, 0, -192, 42, -97, -175, 46], [-35, -75, 40, 81], [8, 80, -20, -159, -36, -128, 96], [3, -193], [-35, -13, -69, -2], [11, 89, -183, -49], [-67, -184], [-164, -183, -107, 77]]
[EX A]: [46, 81, 96, 3, -2, 89, -67, 77]

[EX Q]: [[-75, 62, -123, -84, -182, -89, -65], [-21, -26, -152], [-55, -22, 79, -94, 73], [19, -107, -198, -62, -109], [53, -72, -43, -134], [49, -54]]
[EX A]:
[62, -21, 79, 19, 53, 49]