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]: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
[EX A]: [98, -11, 98, 26, 10]

[EX Q]: [[-18, 44, 37, -24], [-56, -127, -121, -102, -189, -43, -175], [-108, -188, 93, -46, -6], [4, -164, 23, 16], [-179, 9, -58]]
[EX A]: [44, -43, 93, 23, 9]

[EX Q]: [[-36, 51], [-139, 36, 42, 94, 65, -2, -162], [-87, -127, -65, 70, -22, -182], [-54, -41], [-51, -70], [96, -8], [49, -104, -143, -149, -72, 7], [99, -138, 75, -168], [33, -1, -150]]
[EX A]:
[51, 94, 70, -41, -51, 96, 49, 99, 33]