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: [[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]

A: [66, 78, -6, 42, 66, 42]
****
Q: [[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]

A: [89, 85, 85, 1]
****
Q: [[12, 77, 77, 87, 67, 71], [28, 30, -14], [-62, -152, -90], [-183, -173, 88, 72, -165], [-119, -4, -157, 82, -153, -167, 42], [-127, -59, -184, -143], [78, 11, -186, -184]]

A:
[87, 30, -62, 88, 82, -59, 78]
****