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]: [[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]: [[-15, 93, -70, -39], [-157, -29, 74, -14, -155], [74, -176, -85, -143, 4, 0, -25]]
[A]: [93, 74, 74]


[Q]: [[-128, -66], [-1, -43, -157], [-150, 35, -111, 87, -10, -65], [13, 94, -110, -90], [-145, 40, -12, 77, 54, -24], [16, -143], [-157, 6, -158, -152, -149]]
[A]:
[-66, -1, 87, 94, 77, 16, 6]