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]: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
[A]: [89, 96, -69, 40, 90, 75, 99, 98, 41]


[Q]: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]
[A]:
[97, -35, 7]