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]: [[7, 42, -200, -138], [-113, -158, -17, -60, -38]]
[EX A]: [42, -17]

[EX Q]: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]
[EX A]: [47, 27, 93, 67, 100, 70, 11, -5, -17]

[EX Q]: [[59, -116, -75, -51], [-79, -81, -6], [-103, 40, -158, -16], [54, -135, -106, -144, 24, -94], [-77, 63, 15, 29]]
[EX A]:
[59, -6, 40, 54, 63]