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]: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]
[EX A]: [-12, 8, 76, 96, -36]

[EX Q]: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
[EX A]: [66, 16, 16, 69, 12, 80]

[EX Q]: [[0, -17, 79, 91, 55, 18], [60, -95, 78, 83, -154, -150, 89], [-12, 98, -93, 14, -187], [-112, -198, -77, -102, 84, 4]]
[EX A]:
[91, 89, 98, 84]