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]: [[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]
[EX A]: [65, 75, 21, 82, 4, -3, 21]

[EX Q]: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
[EX A]: [82, -53, 34, 100, 65, 57, 65, 58, -101]

[EX Q]: [[-147, -34], [-175, -21, -170, -76, 84], [38, -30], [35, 43, -36, -50, 21, -179], [-17, 71], [-195, -112, 37]]
[EX A]:
[-34, 84, 38, 43, 71, 37]