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]: [[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]
[EX A]: [81, 67, 86, 59, 75]

[EX Q]: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]
[EX A]: [51, 69, 92, 52, 82, 70, 65]

[EX Q]: [[-93, 15, 72, -49, 10, -125, -90], [35, -94, -9, -125, -70, -107, -185], [96, -98, 74, 27, -110, 91, 63], [-82, -157, 95, 78, -17, 92, 88], [-101, -9], [-15, 69, -129, -153, 13]]
[EX A]:
[72, 35, 96, 95, -9, 69]