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]: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]
[EX A]: [-55, 98, -27]

[EX Q]: [[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]
[EX A]: [33, 34, 68, -13]

[EX Q]: [[-197, -33, 79, -166], [-127, 79], [-153, -112, -5, -56, -151], [42, 89], [37, 82, -196, -46], [-28, -160, -118, -161, 57, 74], [-184, -24, -158]]
[EX A]:
[79, 79, -5, 89, 82, 74, -24]