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]: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]
[A]: [61, 73, 78, 71, -99, 88, -30]


[Q]: [[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]
[A]: [46, 78, 79, -22, 96]


[Q]: [[-82, -164, 9, 15, 16, 99, -144], [-44, 82, -135, -55], [-146, -172], [-78, 78, 50, 93, 2], [-76, 17, -192], [-31, -153, -39, -53], [38, 85, 61, -7, -15, -135], [-51, -50, -183, -189, -142]]
[A]:
[99, 82, -146, 93, 17, -31, 85, -50]