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: [[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]

A: [98, 72, 48]
****
Q: [[-176, -79, 30, -192, -159], [-109, 70], [-153, -51, -184], [-182, -21], [45, -108, -169, -191], [70, -177, -145, 24, -66, -131, 66]]

A:
[30, 70, -51, -21, 45, 70]
****