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]: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]
[EX A]: [98, 79, 97, 65, 71, 43, -72]

[EX Q]: [[-4, 11], [12, -196, -120, 66, -157, -72]]
[EX A]: [11, 66]

[EX Q]: [[-147, -82, -18, -79, -22], [-25, -75, 93, -184, -70], [-132, -105, -94], [-194, -106, -69, -85], [-139, -190, -51, -20, -21, -120], [-180, 64, -110], [-2, -187, -82], [92, 82, -88], [-12, 25]]
[EX A]:
[-18, 93, -94, -69, -20, 64, -2, 92, 25]