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: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

A: [-18, 95, 50, 81, 49, 91, 94, 59]
****
Q: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]

A: [79, 0, -71, 32, 98, 26, 20, 70]
****
Q: [[-153, 13, -198, -139], [-137, -70, 60, -142, 59, -67, 48], [-78, -35, -97, 48, -151], [-23, -176, -185, -190, 6]]

A:
[13, 60, 48, 6]
****