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]: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
[A]: [49, 34, 10, 52, 78, 31, 30, 18]


[Q]: [[-99, -133, 80, -160], [-10, -33, -172, 1, -182, -142, -140], [-105, -117, 58, 35, 83]]
[A]: [80, 1, 83]


[Q]: [[-190, -127, 54, -55], [92, -40, -17, 24, 2, -187], [80, -42, 5, -70, -137, 9, -134], [-172, -57, -112, -141, -36, 50, -48], [17, -149, -24, -144, -25, 52], [1, -193, -12]]
[A]:
[54, 92, 80, 50, 52, 1]