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]: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[A]: [-26, 0, 75]


[Q]: [[97, -63, -64, -183, 95, -144], [-60, 44, -72, 31, -170, 88], [-127, 4, 73, -124, -186], [59, -117, -13, -186], [9, 39], [-174, 92, 4, -67, -112], [78, -107], [48, -75, 13, -184, -140, -104]]
[A]: [97, 88, 73, 59, 39, 92, 78, 48]


[Q]: [[51, -101, -21, 92], [-198, 17, 34, -192, -78], [-34, 55, -77, -25, -153, -62, -81], [47, -197, -56, -179], [-157, -52, -143, 18, -37, -173], [76, -25, -75, 62], [-58, 62, 96, 59, 55], [-17, -90, 79, -114, 88, -114], [-198, -101, 81, -17, -7, -119]]
[A]:
[92, 34, 55, 47, 18, 76, 96, 88, 81]