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]: [[-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]: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]
[A]: [-93, 50, 32]


[Q]: [[97, 83, 13, 63, -96, -151, 4], [-104, -87, -56], [-92, -157, -41, -191, -1, -198, -36], [-81, -99], [-199, 86, -140], [-55, -93, -127, -70, 84, 63, -178], [2, 53, -77, -169, -52]]
[A]:
[97, -56, -1, -81, 86, 84, 53]