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]: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]
[EX A]: [76, 41, 90, 32, 39]

[EX Q]: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]
[EX A]: [24, -39, 95, 71]

[EX Q]: [[43, -46], [-161, 68], [-140, 78, -23, 11], [19, -113], [-37, -124, -88, -12, 89], [-10, -185, -142, -28, -173, -37], [-89, 63, 53], [63, 32, -19, -105]]
[EX A]:
[43, 68, 78, 19, 89, -10, 63, 63]