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]: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]
[EX A]: [44, 57, 55, 78, 8, -10, 13]

[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]: [[-63, 10, 96], [67, -10, 98], [66, -195, -75]]
[EX A]:
[96, 98, 66]