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]: [[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]: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[A]: [52, 39, 95, 2, -17, 57, 73, 70, 44]


[Q]: [[-34, 75, -95, -107, 37, -18, 20], [-93, 63, 40, -198, -127], [-198, 1], [-170, 61, -136, 92, -165, 24, -174], [87, 49], [-39, 62, -92]]
[A]:
[75, 63, 1, 92, 87, 62]