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]: [[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]
[EX A]: [24, 48, 2, 1, 18]

[EX Q]: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]
[EX A]: [67, 26, 7, -16, 78, 79, 4, 85, 35]

[EX Q]: [[29, -99], [-70, -147], [15, 70, -93], [-49, -191, 95, -37, -114], [55, -132, 50, -119, 6], [-140, 5, 1, 21], [69, -194, -105, -149, -79], [-189, -63, 38, -15, -157, 17, -14]]
[EX A]:
[29, -70, 70, 95, 55, 21, 69, 38]