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]: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
[EX A]: [-111, 83, -8, 92, 55, 91, 70]

[EX Q]: [[92, -175], [-99, -116]]
[EX A]: [92, -99]

[EX Q]: [[16, -15], [-199, 25, -160, -107, 91], [-104, -22, 46], [-40, 11, -13], [-55, 49, -174], [-146, -50, -13, -192]]
[EX A]:
[16, 91, 46, 11, 49, -13]