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]: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]
[EX A]: [74, 78, -132, 63, 73, 39]

[EX Q]: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]
[EX A]: [95, -43, 91, 90]

[EX Q]: [[3, 13, -37, -116, 9, -61, -6], [-41, -44, -73], [-14, -103, -121, -176, -147, 98], [4, -140, -37, -195], [-183, -110, -103, -123, 89]]
[EX A]:
[13, -41, 98, 4, 89]