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: [[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]

A: [43, 11, 11, 58, 21, 100, 25]
****
Q: [[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]

A: [97, 23, -2, 61, 62, 68, 12, 15]
****
Q: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]

A:
[67, 85, 90, 76, 81, 98, 94]
****