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: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

A: [75, 51, 10, 53, -43, 17, -111]
****
Q: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]

A: [-37, 94, -21, 76, 85, 93, 72, 5, 87]
****
Q: [[67, -151, -135, 80, -133], [53, -24, 73, 85, -111], [72, 26, -1, 86], [2, 45, 90, -158, 99], [26, -35, -126, -121, 55], [65, 54, 58, -198], [-78, -55, -66]]

A:
[80, 85, 86, 99, 55, 65, -55]
****