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, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]

A: [20, -71, 9, 97, 46, 17, 90]
****
Q: [[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]

A: [93, 7, 60]
****
Q: [[49, 16, -186], [47, 49, -185, -181], [22, -83, -111], [-1, 91, -36, -5], [-182, -185], [-98, -34, -178, 78, -160], [-3, -135, 71, 89]]

A:
[49, 49, 22, 91, -182, 78, 89]
****