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]: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[A]: [20, -71, 9, 97, 46, 17, 90]


[Q]: [[-54, 0], [-117, -105, -110, -193, -127], [-92, -195, -99, -147, -35, -151], [-81, -165, 52, -81], [63, -77, -167, 23, 7], [-200, -62, -56]]
[A]:
[0, -105, -35, 52, 63, -56]