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]: [[64, -108], [42, 76, -28, -11, 28], [-37, -188, -155, 73, -137, 29], [-159, 66, 72, 95, -81], [-176, 24], [89, -106, 36, -126, -155], [-194, 39, -96, -11]]
[EX A]: [64, 76, 73, 95, 24, 89, 39]

[EX Q]: [[13, 57, -9, -14], [-52, -50], [-53, 99, -145, 13, 32], [-195, -147, -179, 6, 67], [-189, 54, -1, -111], [-152, -12, -169, 62], [-4, -134, -18, 7, -134, -66, -23]]
[EX A]: [57, -50, 99, 67, 54, 62, 7]

[EX Q]: [[-170, 31, 66, 89, -93], [-16, -170, 51, 60, -36, 56], [-49, 63], [41, 84, -60, 70, 63, -128, 30], [26, -111, -160, -171, -37], [12, -182, -77, -137], [-146, -37, 96, -168, -128, 35], [18, 34, -26, 30], [-24, -59, -2, -125, -156, -107, -8]]
[EX A]:
[89, 60, 63, 84, 26, 12, 96, 34, -2]