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]: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
[EX A]: [98, 56, 93, 13, 28, 59, 74]

[EX Q]: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]
[EX A]: [62, 84, 96]

[EX Q]: [[-103, 39, -4, -131, -179], [4, -70, -142, -41, -18, -37], [16, 32, -48], [40, -134], [-186, -147, -130, 77, -6], [-44, -123, 43, -31, -92, -86, 49], [-41, -109, -1, 42, 34], [-164, 16, 96, 94, -38, 84], [61, -190]]
[EX A]:
[39, 4, 32, 40, 77, 49, 42, 96, 61]