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]: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
[A]: [86, 23, 78, 68, -116, 72, 55, 53]


[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]: [[-31, 64], [-147, -132, -108, -49, 82], [18, -136], [-175, -198, -170, -62, 35], [97, 32, 70, 56], [-160, 10, -31, 75, 25, -140, -184]]
[A]:
[64, 82, 18, 35, 97, 75]