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: [[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]

A: [83, 77, 52, 97, 49]
****
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: [[9, 26, -120, 79, -148, -72, -109], [5, 52, 28, -20, -89, 7], [-136, 92, 95], [-9, -170, 62]]

A:
[79, 52, 95, 62]
****