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]: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]
[EX A]: [0, 22, 17, 48, 80]

[EX Q]: [[-191, 15, 11, -122, -8, -77, 51], [82, 28]]
[EX A]: [51, 82]

[EX Q]: [[41, -130, 44, -43, -112], [45, -142, -162, 78, -195, -6], [95, -85, 29, -52, 40], [77, -127, 18, 57, 19], [-4, -75], [74, -194, 49, -168, -188, 89, -168], [-139, 32, -176, 97, -166, -174], [15, -149, -33, -22]]
[EX A]:
[44, 78, 95, 77, -4, 89, 97, 15]