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]: [[-19, -151], [33, 54, 85]]
[A]: [-19, 85]


[Q]: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
[A]: [75, 95, 70, 68, 100, -2, 15, 32, 97]


[Q]: [[-91, -115, 17, -132, 37, -117], [-169, 54, -132, -188, -156], [65, 58, -80], [-83, -150, -8, -38], [-26, -151, 0, -123]]
[A]:
[37, 54, 65, -8, 0]