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]: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]
[EX A]: [75, 34, 96, 33, 21, 50, 17]

[EX Q]: [[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
[EX A]: [-105, 97, 59, 80, -47, -51, 9, 70, 81]

[EX Q]: [[60, 9, 51, -109], [59, -118, -53, 82, -66, 25, 44], [-86, -66, -11, -108, -40, -73], [-143, -36, -113, 35, 78], [-88, -189, 54, -2], [15, -50], [-78, -162, -14, -138, -105, -37], [-10, -190, 96, -63], [35, 17, -2, -150, 35, -49]]
[EX A]:
[60, 82, -11, 78, 54, 15, -14, 96, 35]