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]: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]
[A]: [71, 71, -38, 60, 7, 97, 76]


[Q]: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]
[A]: [79, 56, -1, 85, 89, 61, -62, 31]


[Q]: [[-49, 50], [72, -22, -148], [-99, -123, -5, 89, -43, -160, -90], [-22, 29, -90], [-69, -31, -43, -96, -145, -63], [-194, 66, -155, -100, 65, -110], [42, -121, 84, 0, 76]]
[A]:
[50, 72, 89, 29, -31, 66, 84]