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: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

A: [92, 46, 25, 19]
****
Q: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

A: [2, 72, 60]
****
Q: [[5, 63, -196], [-143, -116], [-176, 30, -42, 8, -98, 11], [-134, -46], [-49, -23, 28, 43, -157, 3], [-27, -193, 80, 85], [-183, -122]]

A:
[63, -116, 30, -46, 43, 85, -122]
****