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, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]
[EX A]: [78, 2, 43, 74, 67, 31, 40, 91]

[EX Q]: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
[EX A]: [58, 19, 68]

[EX Q]: [[-54, 74, -166, 68, 0, -16], [-20, -159, 81, -180, 47], [-65, 14, 16, -73, -149, 86], [40, -129, -94], [-33, 25, 53, -127, -13, -95], [38, -113, -197, -65, -198, 18, -156], [-22, -24, -191, -120, -62], [-173, -190, 32, -144], [8, -169, -149, -9, -102]]
[EX A]:
[74, 81, 86, 40, 53, 38, -22, 32, 8]