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]: [[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]
[A]: [92, 50, -48, 70, 50, 30, 14, 7, 62]


[Q]: [[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]
[A]: [82, 98, 76, 12, 58, 85, 9, 86]


[Q]: [[88, -84, -57, 16, -168, -133, 22], [-193, -91, -164, -49, -128, -151, 97], [-180, -87, -101, -32], [-142, -48, -179, 97, -17, -140, -192]]
[A]:
[88, 97, -32, 97]