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]: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[EX A]: [60, -32, 68, 93, 24, 26, 7, 85]

[EX Q]: [[-167, -28, -168, 2, -195, 79, 61], [-162, -169, 37, -34, -6, -72, 35], [87, 23, -186, -155, -38, 77], [-67, 61, -46, 2, -38, 65], [16, -62, -169, 89, -137, -136], [-90, -111]]
[EX A]:
[79, 37, 87, 65, 89, -90]