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: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]

A: [83, 87, 54, -18, 51, -13]
****
Q: [[-141, -55, 55, 81, 61, 3, 79], [-48, -81, -58], [-27, -114, -39], [9, 37], [42, -68, 3, 80], [-11, -157, -182, -103, -114], [-165, -189, -38, 26], [-92, -124], [-169, -180, -51, 91, 23, 34, 66]]

A:
[81, -48, -27, 37, 80, -11, 26, -92, 91]
****