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]: [[-65, -132, -105, 40, 32, 84], [-53, -33]]
[EX A]: [84, -33]

[EX Q]: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
[EX A]: [25, 32, 86, 96, -33, 84, 93]

[EX Q]: [[38, -134, -117, -141, -36, 1, -146], [-71, -185, -152, -19, -82], [-146, -160, -63], [-118, -167, -79, -7], [28, 15, 2, -156, 74], [87, 10]]
[EX A]:
[38, -19, -63, -7, 74, 87]