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]: [[-122, -18], [-126, -168, -62], [-185, 20, -166, 59, -185, -181, -174], [-32, -105, 14, -182], [91, 95], [-12, -124, 4, -192, -101, -200, -69], [-49, -113, 94, 50], [23, -25], [92, -139, -21, -136]]
[EX A]: [-18, -62, 59, 14, 95, 4, 94, 23, 92]

[EX Q]: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[EX A]: [-26, 0, 75]

[EX Q]: [[51, 33, 75, -92, -103, 55], [39, 70, -163, -158, -189, -40], [-192, 52, -42, 95, 77], [59, -152, -54, -103], [-67, 91, -44, 6, -23], [-88, -114, -57], [-35, 60, -58, 35, 74, -6, -149]]
[EX A]:
[75, 70, 95, 59, 91, -57, 74]