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]: [[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]
[EX A]: [78, 80, 91, 99]

[EX Q]: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]
[EX A]: [-16, 68, 80, -85, -15, 94, 69]

[EX Q]: [[52, -95, -195, 47, -11, -118, -166], [-108, -75], [35, -83, -158, -38, 2], [-83, 81]]
[EX A]:
[52, -75, 35, 81]