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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

A: [-3, 50, -38, 51, 42, 54, 81, 76]
****
Q: [[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

A: [59, -12, -25]
****
Q: [[-79, 59, -53, 12, -51, -95, -185], [91, -183, -31, 39], [-175, -185, 40, 59, -127], [-42, -174, 53, -164]]

A:
[59, 91, 59, 53]
****