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]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[EX A]: [75, 51, 10, 53, -43, 17, -111]

[EX Q]: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
[EX A]: [54, 44, 50, 12, 24, -28]

[EX Q]: [[-152, -147, -175], [-12, 5, -191, -199, -147, -126, 75]]
[EX A]:
[-147, 75]