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: [[-27, -28, 59, -2, -90, 50, -81], [9, 83, -62, 32]]

A: [59, 83]
****
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: [[-47, -144, -91], [-84, -61, -171, -56, -111], [-61, 45, 39, 13, 77], [-6, 77, 35, -93, 33, -27], [-109, -111], [-185, 58, 96], [-140, -8, -87, 71, -96]]

A:
[-47, -56, 77, 77, -109, 96, 71]
****