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]: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]
[A]: [-18, 95, 50, 81, 49, 91, 94, 59]


[Q]: [[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]
[A]: [72, 52, 84, 84]


[Q]: [[-131, -182], [-50, -96, -116, 81, 89], [-178, -15, 60, -159, -175, -102], [-193, -156, -172, -89, -92], [-107, 82, 94, -54], [-74, 90]]
[A]:
[-131, 89, 60, -89, 94, 90]


