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]: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
[A]: [91, -49, 89, 83, 92, -91]


[Q]: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]
[A]: [-19, 15, 24, 84, -138, 76]


[Q]: [[37, 33, -84, -81, -186], [60, -42, -172, -142, -54, -86, -69], [-73, -23, -39], [56, 58], [-163, -13, 45, -12, -132]]
[A]:
[37, 60, -23, 58, 45]