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]: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]
[A]: [45, 33, 26, 69, 89, 95, 57, -4]


[Q]: [[-152, -34, -97, -172, -195, -77], [-100, -82, -18, -191, -18, 2, 35], [59, 61, 84, -86, -199, 45, -83]]
[A]:
[-34, 35, 84]