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]: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]
[EX A]: [68, 57, 94, 3, 88, 34]

[EX Q]: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]
[EX A]: [90, 98, 22, 85, 64, 77, 63, -152]

[EX Q]: [[-59, 40, 32, 68, 60, 63], [-86, 19, -54, -35, -149]]
[EX A]:
[68, 19]