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]: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]
[EX A]: [79, 88, 93, 89, 32, 40]

[EX Q]: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
[EX A]: [38, 66]

[EX Q]: [[-180, -186, -109, -85], [-88, 50, 10, -179, 20, 55], [-14, -148, 99], [50, -40, -182, 100], [74, -161], [-85, -53], [-166, -61, -79, 41], [-38, -182, -69]]
[EX A]:
[-85, 55, 99, 100, 74, -53, 41, -38]