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]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[EX A]: [75, 51, 10, 53, -43, 17, -111]

[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]: [[24, -156, -15, -5], [-200, 98, 29, -29], [-43, -142, -86, -117], [-61, 94, 44, 56, -60, -51], [-32, -4, -185], [-158, -170], [-121, 30, 38], [-22, -142]]
[EX A]:
[24, 98, -43, 94, -4, -158, 38, -22]