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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

A: [-55, 98, -27]
****
Q: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

A: [74, 78, -132, 63, 73, 39]
****
Q: [[91, -172], [24, 89], [-70, -173, 48], [-142, -186, -176, 15, -43, -88], [-130, 79], [4, -166], [96, -193, -169, -183, -105, -197], [-69, 14, 68], [41, -15, -72]]

A:
[91, 89, 48, 15, 79, 4, 96, 68, 41]
****