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: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]

A: [69, 65, -70, 55, 46, 38]
****
Q: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]

A: [-121, 80, 98, 56, -17, 10, 55]
****
Q: [[-99, -16], [-40, -15, -17], [23, -34, 64, -30, -75, 62], [-80, -186, 44], [-27, -69, -196, 89, -49, 37, -20], [24, -169], [-14, 13], [28, 44, -195, 91]]

A:
[-16, -15, 64, 44, 89, 24, 13, 91]
****