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]: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]
[EX A]: [-26, 31, -27, 94, 69, 47, 55, -8]

[EX Q]: [[-88, -5, -49], [-193, -42], [-32, 93], [-85, -48, -76, -76]]
[EX A]:
[-5, -42, 93, -48]