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: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

A: [82, -53, 34, 100, 65, 57, 65, 58, -101]
****
Q: [[-168, -52], [-183, 2, -104, 24, -153, -56], [25, 78, -118, -28, -39, -12], [97, 95, 12, -21, 82]]

A: [-52, 24, 78, 97]
****
Q: [[-168, -171, -48, -160], [-70, -182, 31], [91, -47, -124], [-26, -171, 49, -29, 51, -71, -136], [-191, -84, 56, 69, -25, -33, 83], [-2, -162, -146, -126, -24, -184, 89], [-2, 42, -115], [-90, -26, -26, 28, -172], [-89, -165]]

A:
[-48, 31, 91, 51, 83, 89, 42, 28, -89]
****