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]: [[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]
[EX A]: [-59, 78, 25, 94, 91]

[EX Q]: [[-72, 58], [-110, -110, 92, -58, -181, -159, 35], [-12, 67, -22, -15, -8, -190], [-163, -166, -128, -150, 70, 54]]
[EX A]: [58, 92, 67, 70]

[EX Q]: [[-27, 84, -81, 70, -4], [-3, -146, -10, 73, 16, -82], [-64, -51, 42, 65, -127, -32], [-58, -177, -162], [-52, -151, -160], [39, -101], [-69, 98], [-98, -142, 16, -172], [17, -24, 27, -35, -5, -190]]
[EX A]:
[84, 73, 65, -58, -52, 39, 98, 16, 27]