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: [[-187, -179, -53, 29, -130], [45, -50, -46, -23, 82], [12, -82, 28, -108, 24, -77, -51], [2, -181, 87, -1]]

A: [29, 82, 28, 87]
****
Q: [[-127, 25, -39], [-170, -199], [16, -90, -101, -87, -169, -97], [-128, -198, -186, -106, -1, 94], [-54, -51, 31, -150, -155], [43, 39, -174, -174, -34, -109, -147], [-157, 43, -177]]

A:
[25, -170, 16, 94, 31, 43, 43]
****