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]: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
[A]: [97, 90, 93, 52, 52, -29, 37, 79, 80]


[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]


[Q]: [[-105, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]
[A]:
[11, 11, 35, 82, 48, 95, 2, 0, -115]