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]: [[-31, -48], [7, -142, -76]]
[EX A]: [-31, 7]

[EX Q]: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
[EX A]: [21, -38, 99, 89, 40, 46, 69]

[EX Q]: [[-66, -94, -68], [-68, 18, 59]]
[EX A]:
[-66, 59]