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]: [[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]
[A]: [77, 98, 57, 95, 68]


[Q]: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]
[A]: [65, -105, 61, 82, 98]


[Q]: [[25, -49], [-8, 72, -198], [-152, -3, -82, -85], [-180, 46, -160, -125, -26], [97, 69, 60, 82, -104, -154, 3], [-133, -17, -75, -49, -25, -198, -30], [-78, -8, -57, -145, 70], [-154, 96, -163, 63], [-67, -38, -172, -154, -170, 65]]
[A]:
[25, 72, -3, 46, 97, -17, 70, 96, 65]