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: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]

A: [81, -36, 35, 65, 59, -31, 33, 89, 98]
****
Q: [[-162, -31, -133, -135, -39, -56, -181], [44, 15], [-173, -96, -174, 61, -118, 6, 27], [-184, -147, -82, -117, -140, -8], [-59, 91]]

A:
[-31, 44, 61, -8, 91]
****