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: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

A: [10, -59, 99, 48, 18, 80]
****
Q: [[-137, -54], [-108, -83, -123], [-137, -169], [29, -94, -165, -43, -19], [-159, 11, -50, -11, -6, -115, 53], [-89, 67], [50, -198, 100]]

A:
[-54, -83, -137, 29, 53, 67, 100]
****