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: [[-80, -194], [-27, -106, -119], [-185, -153, -114]]

A: [-80, -27, -114]
****
Q: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

A: [31, -1, 65, -15, -38, 59, -23]
****
Q: [[-167, -135, -182, -147, 21, -20, -141], [-7, -69, 59, -63, -191, -161, 33], [100, -43, 49, 85, -197, 33, 24], [-185, 35, -72, 3], [54, -65, -111], [47, 59, -170, 20, -165, -133], [58, -195, -185]]

A:
[21, 59, 100, 35, 54, 59, 58]
****