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]: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]
[A]: [75, 57, 75, 20, -95, 20]


[Q]: [[-191, 15, 11, -122, -8, -77, 51], [82, 28]]
[A]: [51, 82]


[Q]: [[69, 6, 2, -80, 75, -128, -44], [-93, -5, 21, 21, -98], [-67, 7], [-196, -186, -53, -89, -59], [-93, 93, -149, 33, 11, -34]]
[A]:
[75, 21, 7, -53, 93]