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]: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[EX A]: [10, 83, 86, 22]

[EX Q]: [[-57, -120, -189, -120, 32], [-164, -73, -63], [-59, 86, -58, -141, -197, -9], [-194, -36], [30, -136, 52, -136, -151, 2], [-5, 57, -77], [-97, -188, 57, 38, -70, 62, -130], [-20, -52, -41, 29, -183]]
[EX A]:
[32, -63, 86, -36, 52, 57, 62, 29]