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: [[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]

A: [93, 17, 78, 84, 35]
****
Q: [[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]

A: [32, 26, 72, 53, 75, 58, 92, 44]
****
Q: [[78, -21, -168, -121, -50, 75], [80, -143, -45, -86, -180], [84, 35, 85, -128, -77, 40, -182], [-89, -154, -77], [41, -22, 10, 88, 71], [-54, 13, -117, -18, 79]]

A:
[78, 80, 85, -77, 88, 79]
****