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: [[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]

A: [64, 4, 44, 91, 57, 62, -3, -10]
****
Q: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

A: [99, 54, 32]
****
Q: [[69, 97, 74, -109, 61, -15, 39], [-174, -134, -79, 35, -142, -97], [-137, -106, 69, -90], [29, -16, -200, -135], [20, -107, 41, 82, -192], [-103, 75, -19, -176], [43, -31], [44, 0, 34, -97, -189, 36], [39, -104, 70]]

A:
[97, 35, 69, 29, 82, 75, 43, 44, 70]
****