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]: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]
[EX A]: [-6, 36, 29, -46, -41, 35]

[EX Q]: [[-45, -1, -51], [-156, -12, -52, -85, -77, -21, -82], [-134, -82, -110, -168], [-118, -182, -74], [21, -44, 78]]
[EX A]: [-1, -12, -82, -74, 78]

[EX Q]: [[-174, -62, -160, -86, -45, -89], [-192, -39, 75, -103, -30], [-128, 20], [-49, 57, 83, -13, -156], [-88, -27]]
[EX A]:
[-45, 75, 20, 83, -27]