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: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

A: [45, 17, 92, 12, 28, 8, -93]
****
Q: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]

A: [-19, -112, 30, 59, 65, -7, -16, 86, 39]
****
Q: [[-87, 36, -127], [-118, -114, -99, 98, 67, 73], [-165, -129, -159, 55], [25, -39]]

A:
[36, 98, 55, 25]
****