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]: [[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]
[A]: [85, 21, 34, 90, 81, 32, 77, 65, 97]


[Q]: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]
[A]: [49, -27, -132, 98, 73, 74]


[Q]: [[-168, -124, -165], [-76, -184], [93, 7, 68, -164, -189, -149], [97, 94], [-188, 2, -2, -198, 72, 55, -115], [-101, -64, -20], [-163, 57, -81, 89, -14, -113, -76]]
[A]:
[-124, -76, 93, 97, 72, -20, 89]