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: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

A: [84, 1, 35, -78, 24, 87]
****
Q: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

A: [12, -16, 41, 50]
****
Q: [[55, -148, -143, -95, -78, -99, -168], [54, -2, -103, -37], [-61, 58, 95, -115, -97, -192, -15], [-86, 31, -174, -39, -194, -14, 40], [39, 14, -146, -85, 85, -125], [-117, 95, -5, -194, 46, 91], [-167, -38, -151, -131], [-72, -21, 22, -37], [27, -99, 70]]

A:
[55, 54, 95, 40, 85, 95, -38, 22, 70]
****