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: [[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]

A: [91, 3, 49, 70, 91]
****
Q: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]

A: [63, -33, 43, 68]
****
Q: [[-99, -127, -15, 20], [-23, 0, -165], [-158, -124, -57, 7], [-16, -169, 97], [83, -105, -147], [7, -159, -74, -181, -47]]

A:
[20, 0, 7, 97, 83, 7]
****