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: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

A: [79, 56, -1, 85, 89, 61, -62, 31]
****
Q: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

A: [51, 69, 92, 52, 82, 70, 65]
****
Q: [[-118, -161, 72, 88], [-158, 69], [65, -136, -164, -160], [-197, 93], [-84, -142, 43]]

A:
[88, 69, 65, 93, 43]
****