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]: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]
[A]: [80, 56, 46, 29, 14]


[Q]: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[A]: [93, -40, -72, 13, 91, 35, 33, 28]


[Q]: [[-106, -29, -200, -79, -175, 46, -12], [-71, 22, -1, -44, -82], [-94, -166, 100, -62, 75], [-81, -96, 26, 20, 13, 57, -170]]
[A]:
[46, 22, 100, 57]