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: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]

A: [37, 75]
****
Q: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

A: [51, 49, 86, 66, 74, -151, 49, 25]
****
Q: [[94, -41, -58, 85], [-99, 16, 44, -95, -181, 24]]

A:
[94, 44]
****