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]: [[-4, 11], [12, -196, -120, 66, -157, -72]]
[EX A]: [11, 66]

[EX Q]: [[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]
[EX A]: [-19, -24, 93, -55, 52, 96, -22]

[EX Q]: [[44, -79, 13], [-127, -171, 5, -66, 44, -95, -2], [-175, -180, 8, -183, -41, -108, 12], [-158, 71, -52, -157, -8, 46], [-126, 43, 78, -114], [-128, -105, -84, -157, -56, 69, -160], [-120, 3], [41, -138, -33]]
[EX A]:
[44, 44, 12, 71, 78, 69, 3, 41]