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]: [[-81, -174, -79], [6, -131, -75, 40]]
[EX A]: [-79, 40]

[EX Q]: [[13, -88, -158, -23, -13, 32], [-125, -174], [-114, -42], [-13, -146]]
[EX A]:
[32, -125, -42, -13]