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]: [[-42, -87], [-101, -39, -128, 73, -16], [85, -168], [-166, -107, -135, -139, -35, 76]]
[EX A]: [-42, 73, 85, 76]

[EX Q]: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
[EX A]: [36, 69, 66, 79]

[EX Q]: [[96, -171, -23, -83, 61], [90, 96, -14, 81, -78], [-74, -74, -145, -91, 30], [-82, -126, -97, -21, -94, 38], [-1, -86, 55, -186, -156], [-169, 75, -48, -184], [79, -21, 68]]
[EX A]:
[96, 96, 30, 38, 55, 75, 79]