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]: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]
[A]: [-68, 30, 99, 15]


[Q]: [[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]
[A]: [72, 77, 74, 24, -168, -8, 64, 59, 45]


[Q]: [[-19, -24, 45, -24, 51], [52, -115, -21, -95, 77, -199], [39, 66, -19, 80, -161, 40, -80], [-45, -171, 66, 42, -46], [-136, -87, -136, -66]]
[A]:
[51, 77, 80, 66, -66]