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]: [[-76, -194, 15, 74], [-60, -20, 6], [-118, -40, 82], [-135, 13], [10, -24, -119, -62, -109], [0, 5]]
[A]: [74, 6, 82, 13, 10, 5]


[Q]: [[79, 50], [90, 81, -105]]
[A]: [79, 90]


[Q]: [[-78, -26, 63, -10, -68, -97], [71, -180, -179, -69, -185, 24, -30], [73, -96, -65, 22, -53, -66, -85], [-89, -64, 2, 2, -148, -165], [-162, -171, -71, 29, -2], [-63, 21, -132, -166, -85, -163, 59], [77, -159, -13], [-119, -18, -190]]
[A]:
[63, 71, 73, 2, 29, 59, 77, -18]