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]: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]
[EX A]: [-76, -61, 22, 62]

[EX Q]: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]
[EX A]: [95, 63, 85, -7, 74, 40, 83, 80, 70]

[EX Q]: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]
[EX A]:
[-6, -59, 52, 14, 96, 37, 62]