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: [[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: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

A: [31, -1, 65, -15, -38, 59, -23]
****
Q: [[-65, -188, -19, -145, 35, -29], [47, -46, 55], [-4, 100, -4, -77, -130], [88, -157, -61, -170, -80, 52], [-138, -142, -174, -88], [-4, -90, 61, -135, 22], [-25, 100, 89, -68, -36, -82, 84], [92, -115, -63, 56, -59]]

A:
[35, 55, 100, 88, -88, 61, 100, 92]
****