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: [[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]

A: [91, 3, 49, 70, 91]
****
Q: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]

A: [36, 86, 10, 81, 69, 41, 91, 34]
****
Q: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]

A:
[82, 37, -135, 37, -132, 67]
****