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]: [[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[EX A]: [46, 34, 80, 76, 68]

[EX Q]: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]
[EX A]: [67, 26, 66, 99]

[EX Q]: [[-180, -139], [-107, 77, -152, -33, -83, 11, 94], [-17, 98, 98, -71, -100, -35, -85], [-54, -15, -60, 58, 54, 40, -75]]
[EX A]:
[-139, 94, 98, 58]