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]: [[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]
[A]: [57, 61, 36, 78]


[Q]: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]
[A]: [-65, 43, 97]


[Q]: [[-130, -70, -52, 94, 26, 52, -155], [-125, -117], [-145, -93], [52, 92, -78], [64, 17, -136, -97], [44, -130, 39]]
[A]:
[94, -117, -93, 92, 64, 44]