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]: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]
[A]: [-76, -61, 22, 62]


[Q]: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]
[A]: [55, 21, 75, 84]


[Q]: [[-65, -96, 60], [94, -38, -170, -147, 74], [-23, 34, -66, 8, 44], [-147, -63, 28, -128, -175], [-79, 19], [54, -5], [-143, -168, -124], [14, -173, 36, 80, 18, 40, 98], [98, -109, -30, -169, -45, 91, -110]]
[A]:
[60, 94, 44, 28, 19, 54, -124, 98, 98]