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: [[-154, -145, 28, -154, -52, -41], [-198, 0]]

A: [28, 0]
****
Q: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

A:
[65, -105, 61, 82, 98]
****