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]: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
[EX A]: [91, -49, 89, 83, 92, -91]

[EX Q]: [[-65, -132, -105, 40, 32, 84], [-53, -33]]
[EX A]: [84, -33]

[EX Q]: [[-150, -145], [-59, 76], [-8, -70, -197, -182, -138, -194], [-96, -85, -4, -32, -49], [-113, -59], [-52, 85, -184], [98, -59, 9, -5], [-125, -147, 100]]
[EX A]:
[-145, 76, -8, -4, -59, 85, 98, 100]