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]: [[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]
[EX A]: [33, 100, 74, 69]

[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]: [[3, 84, -87, -87, 13], [-124, -87, -27, -16], [-135, 87, -84, -21, -65], [4, 10], [16, -150, -97, -93, -105, 30, 68], [-159, -120, 14, -47, 29, -44, 94], [-37, -74, 91, -27, 97], [1, -106, -44, -35, 26, 56], [70, -79, -9]]
[EX A]:
[84, -16, 87, 10, 68, 94, 97, 56, 70]