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]: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]
[A]: [8, -11, -47, 24, 61, -67, -11, 70, 10]


[Q]: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]
[A]: [91, 82, 18, 46, 37, 17, 46, 74]


[Q]: [[-8, -14, -80, 27, 63, -137, -107], [11, -14, 0, -87, 16, -156, 1], [-46, 96, 58]]
[A]:
[63, 16, 96]