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: [[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]

A: [-42, 39, 83, 62, 10, 55]
****
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: [[-47, -90, -88, -93, -36], [13, -137, -126, 63], [33, 8, -57, 79, 37]]

A:
[-36, 63, 79]
****