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: [[-75, 10, -138, -42, 85, 8, -74], [18, 10, -70, 74, -88, -117, -145], [65, -145, 24, -193, -120, -186, -14], [-172, -115, -146], [-87, -180, -38, 77], [91, -50, -12, -23, -38, -89, 71], [-58, 81, -175], [-197, -145, 57, 94, -78, -184, -133], [-50, -183, -127, -77, 41]]

A: [85, 74, 65, -115, 77, 91, 81, 94, 41]
****
Q: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]

A: [68, 57, 94, 3, 88, 34]
****
Q: [[-22, -183, -56, 42, -17], [15, 72, -25, -141, -37, 97], [-7, -71, -15, 92, 54]]

A:
[42, 97, 92]
****