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]: [[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]
[A]: [-20, -7, 84, 98]


[Q]: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
[A]: [79, -33, 2, 42, 81, -142, 71]


[Q]: [[-123, -34, -48, -100, -143], [-11, 46, 61, 37, -156], [-26, -52, -131], [-190, -136, -31, 22, -138, 18], [-166, 66, -148, -44, -194], [-28, -76, -176, 28, -101, -183], [-160, 59], [45, -121, -43], [-13, -116, 74]]
[A]:
[-34, 61, -26, 22, 66, 28, 59, 45, 74]