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: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

A: [10, -59, 99, 48, 18, 80]
****
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: [[68, 58, -119, 36, -181], [-90, -157, -95, -85, 24], [-70, 16, -125, 9, -86], [-157, 53, -56]]

A:
[68, 24, 16, 53]
****