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.

[EX Q]: [[-106, -107, 85, 70, 87, -119, -149], [-41, -103]]
[EX A]: [87, -41]

[EX Q]: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]
[EX A]: [75, 34, 96, 33, 21, 50, 17]

[EX Q]: [[-143, -197], [-174, 65, -130, -185, -64], [-52, -157, -85, -121, 7], [77, -197, -23, 46, -112, -193], [-31, -147, -10], [-41, -131, -63], [2, -141, 68, -5, 11, 3]]
[EX A]:
[-143, 65, 7, 77, -10, -41, 68]