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]: [[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]
[EX A]: [34, 17, 30, -1, 5, 37, 24, 81]

[EX Q]: [[-78, 45], [-124, 37, 96, 43], [-24, -6, -137], [-99, -191, -101, -52], [-9, -100, -193, 24, -31, -112]]
[EX A]: [45, 96, -6, -52, 24]

[EX Q]: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
[EX A]:
[17, 85, 20, 70, 12, 73, 90, 59, 58]