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: [[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

A: [-163, 37, 98, 77, 58, 47]
****
Q: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

A: [61, 73, 78, 71, -99, 88, -30]
****
Q: [[92, -162, -5, -130, -197, -74], [-139, -197, -3, -159], [-85, -108, 56, 73, 97], [-163, -144, -19, -106, -165]]

A:
[92, -3, 97, -19]
****