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]: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]
[EX A]: [73, 26, 81, 48, 31, 25, 44, 31]

[EX Q]: [[-143, 33, -146], [-82, -145, -105, -21], [0, -95, -164], [-153, 9, 51, 84, 71, -82], [5, 73, 67, -153, 11, -136], [-1, 81, -75, -41], [-102, -43, 69, -150]]
[EX A]: [33, -21, 0, 84, 73, 81, 69]

[EX Q]: [[5, -24, -185, -162, -90], [-179, 88, -69, -74, -132], [-157, -94, -187, -109], [100, -14, -106], [-175, 62], [-32, -39, -80, -185, -84, -60, 89]]
[EX A]:
[5, 88, -94, 100, 62, 89]