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: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]

A: [-161, 92, 81, 1]
****
Q: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]

A: [16, 13, 97, 19, 36, 10, 60]
****
Q: [[-82, -181, -187], [-60, -51], [-43, -110, -72, 94], [-198, -148, -168, 5, 49, -186, -4], [-49, -159, 99, 28, 37], [-18, -26, 71, 30, 60, 22], [-139, 68]]

A:
[-82, -51, 94, 49, 99, 71, 68]
****