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: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

A: [75, 34, 96, 33, 21, 50, 17]
****
Q: [[97, -135, -83, -157, 30], [-24, 59, 42, -84, 64, -74], [6, 50, -174], [-170, 93, -66, -136]]

A: [97, 64, 50, 93]
****
Q: [[0, -59, -71], [94, 65, -161, -20, 39], [-186, -186, -113, 84, 31, -106], [-61, -141], [98, -155, 94, -192], [34, 11], [-81, -13], [-143, -77], [-134, -192, 88, 61, -27]]

A:
[0, 94, 84, -61, 98, 34, -13, -77, 88]
****