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: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]

A: [93, 68, 96, 94, 81, 71]
****
Q: [[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]

A: [32, 26, 72, 53, 75, 58, 92, 44]
****
Q: [[-6, -196, -155, -178, -24, -127, -44], [23, 5, 17, -30, -8], [-107, -161, 6], [-121, -54, 39, -137, -172, -184], [-26, -192, 61], [-119, 24, 72, 57, 23]]

A:
[-6, 23, 6, 39, 61, 72]
****