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.

[Q]: [[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]
[A]: [-20, -7, 84, 98]


[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]]
[A]: [46, 81, 96, 3, -2, 89, -67, 77]


[Q]: [[5, -109, 92, -120], [94, 39], [-100, 10, 9, 32, -89, 58], [-30, -63, -163, -47, -32], [-155, -141], [-70, -42, -69, 81, -65]]
[A]:
[92, 94, 58, -30, -141, 81]