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]: [[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]
[EX A]: [57, 82, 5, 28, 70]

[EX Q]: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
[EX A]: [79, 0, -71, 32, 98, 26, 20, 70]

[EX Q]: [[-53, -73, -28, 45, -182], [49, -85, -89, 13, -100], [-4, -200, -11, 39, -79, -16], [-74, -117, -196], [-177, -185, 63, -44, -31, 68, -63]]
[EX A]:
[45, 49, 39, -74, 68]