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: [[-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: [[78, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]

A: [78, 97, 65, 100, -39, 22]
****
Q: [[-23, 34, -61], [-26, 79, -146, 14], [75, -140, 42, -32, -113, -133, 91], [-62, -117], [86, 40], [-44, -19, -41, 50, -108], [-15, 38, 96, -94], [8, -140, -91]]

A:
[34, 79, 91, -62, 86, 50, 96, 8]
****