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]: [[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]

[EX Q]: [[78, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]
[EX A]: [78, 97, 65, 100, -39, 22]

[EX Q]: [[-9, 24, -199], [-89, -26], [96, 49], [-92, 57, -171, -179], [-28, -90, -46, -189], [-168, -172, 58, -88, 92], [-180, 89, -161], [-179, 60, 72, -33]]
[EX A]:
[24, -26, 96, 57, -28, 92, 89, 72]