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]: [[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[EX A]: [65, 67, 98, 47, 76, -16, 91, 64]

[EX Q]: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]
[EX A]: [-122, 85, 30, 49, -75, 68, 72]

[EX Q]: [[-96, -2, -12, -158, -93, -179, 24], [76, -172, -165, -124, -36, -108], [1, -155, 68, -12]]
[EX A]:
[24, 76, 68]