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: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]

A: [-61, -68, -103, 97]
****
Q: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

A: [100, 97, 77, 11, 52, 74, 99, -25, 8]
****
Q: [[-178, -97, -99], [-70, -127, 26, 24, 57], [51, -157, 59, -4], [-119, 38, 11, -74, 61, 86], [9, -9, 41, -169, -198], [-108, 20, -25, -111, 88], [-41, -196], [1, 95, 11, -118, -128, -119], [-26, 47]]

A:
[-97, 57, 59, 86, 41, 88, -41, 95, 47]
****