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]: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
[EX A]: [38, 66]

[EX Q]: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
[EX A]: [-7, 91, 93, 86, 39, -35, 74, 72, 17]

[EX Q]: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]
[EX A]:
[100, 3, 97]