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: [[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]

A: [71, 70, 33]
****
Q: [[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]

A: [77, 20, 78, 69, 77, 24, -5, 45]
****
Q: [[-7, -123, -13], [40, 1, -96], [80, -11, -78, -154, -80, -98, -198], [53, 1, -149, -106, 11, -50, 92]]

A:
[-7, 40, 80, 92]
****