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: [[-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: [[-3, -50, 28, 67, -12, 97, -98], [41, 88, 81], [44, -50, -49, -132, -161, 26]]

A: [97, 88, 44]
****
Q: [[84, 92, -20, 91], [47, -136, -93], [9, -132], [-121, 60], [-48, -72, -64, -64, -71, -15], [-38, -13, -81]]

A:
[92, 47, 9, 60, -15, -13]
****