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: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

A: [84, 1, 35, -78, 24, 87]
****
Q: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

A: [75, 51, 10, 53, -43, 17, -111]
****
Q: [[-83, 89, -127, -183, 83, -80, -58], [-151, 73, -134, -191, -155, -195], [42, -91], [-17, -31, -153, 94], [1, 28, -53, 81], [30, -171, 73, -54, -127], [53, -81]]

A:
[89, 73, 42, 94, 81, 73, 53]
****