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]: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]
[EX A]: [16, 13, 97, 19, 36, 10, 60]

[EX Q]: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]
[EX A]: [84, 1, 35, -78, 24, 87]

[EX Q]: [[-83, -158, 80, -126, 44, -58], [35, -159, -180, -174, 57], [-124, -22], [66, -86, 40, 68, -172, -140, -173], [95, -95, -116, -153, 58], [-174, -52, 44], [-118, 51, 64, -91, -82, 37, -164], [77, -79]]
[EX A]:
[80, 57, -22, 68, 95, 44, 64, 77]