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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

A: [83, 79, 34, 49, 11, 75, -6, 67, -96]
****
Q: [[-200, 67], [100, -189, 2, -76, -44, -120], [61, -38, -71], [-105, 50, -71, -145, -107, 43, -1], [-173, -90, 1, -146, -15], [95, -4, 38], [-27, -157, -141, 12, -171, -42], [22, 20, -170, -57], [-148, -178, -12, 92]]

A: [67, 100, 61, 50, 1, 95, 12, 22, 92]
****
Q: [[-43, -107, 17, -25, 65, -177, -191], [-17, -110, 85, -31], [-137, -24, -69, 100, 41], [50, -158, 13, -82], [14, -141, -111, -40, 23], [53, -177]]

A:
[65, 85, 100, 50, 23, 53]
****