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]: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]
[EX A]: [65, 53, 72, -30, 85, 38]

[EX Q]: [[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]
[EX A]: [46, 78, 79, -22, 96]

[EX Q]: [[72, 35], [95, 23, -184, -192, -164, 99, 80], [36, -145, -117, 94], [54, -102, -187, -185, -64, -109], [-99, 95, -199, -129], [-68, -138, 47, -74, -95], [100, -63]]
[EX A]:
[72, 99, 94, 54, 95, 47, 100]