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


[Q]: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]
[A]: [43, -1, 40, 80, 73]


[Q]: [[-102, -138], [-122, -189, 63, -135, 97, -141, -103], [-39, 10, 95, 80, -189, -18, -78], [-88, -47, -36, -173], [67, -196, 0], [50, -86, -121, 13, -126, -157]]
[A]:
[-102, 97, 95, -36, 67, 50]