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]: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
[A]: [97, 90, 93, 52, 52, -29, 37, 79, 80]


[Q]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[A]: [75, 51, 10, 53, -43, 17, -111]


[Q]: [[37, -170, -88], [82, -47]]
[A]:
[37, 82]