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]: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]
[EX A]: [76, -74, 73, 57, 41]

[EX Q]: [[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]
[EX A]: [-134, 11, 21, 86, -74, 18, 81, 92, 79]

[EX Q]: [[17, -198, -25, -177, 38, 83], [-135, 90, -97], [-113, 6], [41, 93, -102, 57, 2, 30, -28], [-83, -123, -98, 44, -36, 23], [35, 100, -64, -67], [28, 65, 35, -129, -145]]
[EX A]:
[83, 90, 6, 93, 44, 100, 65]