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]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[A]: [75, 51, 10, 53, -43, 17, -111]


[Q]: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]
[A]: [-121, 80, 98, 56, -17, 10, 55]


[Q]: [[62, -95, -68, -185], [-149, 66, -48, -116, -18, -69], [-64, -6, 35, 6, 11], [-151, 56, -86, -5, 9], [-72, -1, -169, 83, -106], [-182, -68, -55], [-2, 81], [68, -175, -114, -68], [-124, -142]]
[A]:
[62, 66, 35, 56, 83, -55, 81, 68, -124]