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]: [[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
[EX A]: [55, 51, 83, 61, -9, 67, 15]

[EX Q]: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
[EX A]: [-7, 91, 93, 86, 39, -35, 74, 72, 17]

[EX Q]: [[48, -112, -43, 5, -125, -18, 65], [-86, -102], [-68, -184, -34], [-71, -4, -27], [-175, -182, -75, -1, -65], [-4, -18, 49, -171]]
[EX A]:
[65, -86, -34, -4, -1, 49]