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: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]

A: [-26, -3]
****
Q: [[-92, 66], [-124, -75, -170, -17, 20, -164]]

A:
[66, 20]
****