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: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]

A: [49, 17, 87, 69]
****
Q: [[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]

A: [-61, -151, 63, -48, 2, 66]
****
Q: [[-106, -37], [-179, -83, -41], [100, -55, -26, -184, 37, 77], [-116, 5], [61, -23, -66], [18, -136, -17], [-50, -90, -91, -70, 11], [-102, -166, -173, -143], [80, 26, -24, -26, -142, -76]]

A:
[-37, -41, 100, 5, 61, 18, 11, -102, 80]
****