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: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

A: [25, 59, -59, 90, 68, -84]
****
Q: [[-194, -53], [76, -105, -182, -135, -156, -156], [22, -167, -59], [95, -6, -181], [97, 39, 52, -123, -64, 33, -137], [85, 38, -56, 59, -63], [22, -26, 13, -39], [-118, -51, 91], [24, 99, 93, -169, 80, 46]]

A: [-53, 76, 22, 95, 97, 85, 22, 91, 99]
****
Q: [[80, -119, 40, -162, -139], [-28, -167, 74, -65, -168, -64], [28, 92, -40], [-64, 69, -27, -22, -129], [-24, -154, -181, -105, -185, -147], [-118, -156], [70, -96, -124, -54, -84, -161, 22], [-102, -86, -89, -126]]

A:
[80, 74, 92, 69, -24, -118, 70, -86]
****