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: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]

A: [-4, 92]
****
Q: [[-152, 32, 90], [-45, 9, -5, -134, -107, 36], [-35, 81, 52, -190, -143], [-142, -12], [-190, -101, -61]]

A:
[90, 36, 81, -12, -61]
****