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: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]

A: [-7, 91, 93, 86, 39, -35, 74, 72, 17]
****
Q: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]

A: [97, 23]
****
Q: [[-12, -68, 1, -141, 93], [-27, -11], [-51, -59], [-5, -21, 52, 30], [-88, -167, -167, -74], [-81, -124, -107, -77, 85], [32, -117, -160]]

A:
[93, -11, -51, 52, -74, 85, 32]
****