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]: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]
[A]: [82, -35, 37, 86, 1, 46, 99]


[Q]: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]
[A]: [-10, 25, 77, 94, 79, 40]


[Q]: [[-96, 52, -31, 47, -127], [-140, 99, -21, 20, 7, -200, -116], [-2, -112, 36, -48, -41, -5, -181], [-120, 11, 35, -167, -175]]
[A]:
[52, 99, 36, 35]