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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

A: [-55, 98, -27]
****
Q: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

A: [61, 77, 44, 93]
****
Q: [[-190, -169, -65, -5, 21], [-59, -64, 90, 77], [-10, -73, 64, 4, -167, -106, 56], [-196, 86, -36, -81, -198, 75, -156], [93, 98, -178, -77], [-176, 14, -186, -38, 38, -189]]

A:
[21, 90, 64, 86, 98, 38]
****