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]: [[-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]: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]
[EX A]: [79, 88, 93, 89, 32, 40]

[EX Q]: [[22, 51, 17, 93, -53, 19], [-86, -139, -159, -120, -130], [-2, 29], [0, 85, -17, -135, -73], [-165, -61, -161, -194, -190, -87, 44]]
[EX A]:
[93, -86, 29, 85, 44]

