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: [[-192, -137, -7], [71, 17], [29, -164, -49, -121, 0, -11, -55], [-157, -199, 59, 10, -185, -87], [-183, 93, -165, -198, -139], [-148, -97, 71, -15, 24, -165]]

A: [-7, 71, 29, 59, 93, 71]
****
Q: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

A: [90, 98, 22, 85, 64, 77, 63, -152]
****
Q: [[-12, -121, -84, 80, -187], [15, -110, -86, -163, 35, -70], [-146, -91, -86, 5, 86], [90, -26, 65, 33, -149, -91, -119]]

A:
[80, 35, 86, 90]
****