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]: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[A]: [60, -32, 68, 93, 24, 26, 7, 85]


[Q]: [[-107, 41, 2, -56, -164, -190], [-61, -10]]
[A]: [41, -10]


[Q]: [[51, -86, -2], [-153, -115], [-190, -59, -78], [-33, 86, -143], [59, 55, -84, -76], [15, 66, -73]]
[A]:
[51, -115, -59, 86, 59, 66]