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: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]

A: [49, 17, 87, 69]
****
Q: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]

A: [79, 88, 93, 89, 32, 40]
****
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]
****