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: [[83, 58], [1, -44, 39, 96, -139], [-177, -38, -191, -176, -173], [74, -94, -36], [-117, 29, -68, -191, 50, -102], [-73, -137], [51, -72], [85, -159], [-130, -191, -111, -94, -124, -199, -26]]

A: [83, 96, -38, 74, 50, -73, 51, 85, -26]
****
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, -172], [-144, -73, -72], [-7, -171, -39, -159], [46, 47, -40], [38, -61], [25, -125, 79, -167, -73, -176, 65], [-85, 39, -126], [98, -70, 77, -11], [-37, 86, 11, 83, -54]]

A:
[47, -72, -7, 47, 38, 79, 39, 98, 86]
****