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, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]
[A]: [-43, 100, 61, 82, -28, 42]


[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]: [[74, -43], [-129, -104, -119, 47], [-130, 67], [-174, -139, 60], [-39, 31, -173, -7, -3], [-90, 31, -84, -193], [81, -4, -83, 80, -179, 80], [41, 77]]
[A]:
[74, 47, 67, 60, 31, 31, 81, 77]