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]: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[EX A]: [63, 2, 29, 18, 98]

[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]: [[-139, 61, -144, -125], [73, -162, -19, -169], [98, -94, 69, -165, 59, -189, -183], [29, 1, 45, -105, 90, -3]]
[EX A]:
[61, 73, 98, 90]