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: [[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]

A: [-43, 100, 61, 82, -28, 42]
****
Q: [[-150, -18, -93], [-107, 47, -183, -198, 73], [-188, -186, -24, -12, -56]]

A:
[-18, 73, -12]
****