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]: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]
[EX A]: [35, -69, -81, 92, 91, 58, 48, -41]

[EX Q]: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]
[EX A]: [93, 68, 96, 94, 81, 71]

[EX Q]: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]
[EX A]:
[56, -87, 97, 5, 75, 100, 39, 38]