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]: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
[A]: [38, 66]


[Q]: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]
[A]: [61, 77, 44, 93]


[Q]: [[-169, 18, -96, 16], [17, -60], [37, -152, 83, 97], [-19, 87, 47, -5, -156, -85], [-73, -29, -53, 16, -79, -178], [22, -114], [-133, 1, 51, 50, -90, -138], [-59, -106, 81, -190, -49, -152], [62, 16, -143, -187, -75]]
[A]:
[18, 17, 97, 87, 16, 22, 51, 81, 62]