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]: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
[A]: [-111, 83, -8, 92, 55, 91, 70]


[Q]: [[74, 63, -170, 71, -27], [91, 70, -84, -47, -78, -55], [71, -102, 32], [-197, 10, -82, 13, 1]]
[A]:
[74, 91, 71, 13]