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: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

A: [85, 82, 95, -111, 24, -112, 65, 65, 16]
****
Q: [[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]

A: [75, 70, 47, 87, 37, 72, -12, -5, 76]
****
Q: [[-106, 67, -165, 90], [-99, -98, 46, -140], [-59, -64], [-27, -199, 78, -98, 16, 94, 87], [-178, 96], [-92, 47, -58, 16, -177], [-144, 66, -35, -165, -71, -38, -22]]

A:
[90, 46, -59, 94, 96, 47, 66]
****