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]: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]
[EX A]: [57, 40, 81, 17, 4]

[EX Q]: [[-56, 84, -91, -184, 7, 29, -135], [48, 90, 33], [46, 91, -59], [3, -92, -89, -112, -125, -169]]
[EX A]: [84, 90, 91, 3]

[EX Q]: [[76, -185, 14, -102], [15, 67, 90, -188, -10], [88, -45, -12, 30, 90, -18], [-131, 47, -43, 0, -134], [-105, 94, 29, 2], [63, -152, -158, 92, -27, -147, -115]]
[EX A]:
[76, 90, 90, 47, 94, 92]