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]: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]
[EX A]: [40, 84, 55]

[EX Q]: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]
[EX A]: [80, 83, 88, -39, 77, 60, -16, 93, 86]

[EX Q]: [[46, 40, -149], [-110, 95, -126, -20, -79], [9, -78, 39], [17, -5, 73], [80, 18, -188]]
[EX A]:
[46, 95, 39, 73, 80]