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]: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[EX A]: [55, 64, 56, -31, -4, 51]

[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]

[EX Q]: [[-166, -120], [12, -103, -26, -11, -139, 68, 76], [36, 35], [78, -190, 21, -135, 47, -136, 63], [-122, -128, -53], [38, -50, -96, 0, -152, -144]]
[EX A]:
[-120, 76, 36, 78, -53, 38]