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]: [[54, -120, -69, 80, 56, -111, -19], [64, -158, -131, 32], [60, 26, -150, -14]]
[EX A]: [80, 64, 60]

[EX Q]: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]
[EX A]: [-26, 74, 56, 71]

[EX Q]: [[-155, 24, 39, -173, 26, 38], [-16, 24], [98, -38, -64, 22], [-162, -182, -121, -83, -197, 35, -8]]
[EX A]:
[39, 24, 98, 35]