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]: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]
[EX A]: [99, 1, 16, 19, 62]

[EX Q]: [[-141, -120], [12, -89], [-27, -150]]
[EX A]: [-120, 12, -27]

[EX Q]: [[78, 95], [71, -117], [94, -43, -82, -183, -168], [36, 7, -70, 65, 86, -146], [-25, -156, -83, 33], [28, 48, -135, -30, -157, 18], [31, -42, -40, 76, 19], [65, 6], [-108, -146]]
[EX A]:
[95, 71, 94, 86, 33, 48, 76, 65, -108]