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]: [[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]
[EX A]: [66, 78, -6, 42, 66, 42]

[EX Q]: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]
[EX A]: [99, 54, 32]

[EX Q]: [[-181, -63, -120, -95], [14, -83, 95], [-62, 79, -85, -168, -158], [-1, -124], [-97, -120, -127, -191, 41], [32, -10, -102, -38, -97, 86, -20], [-150, -37, -166, 8, -190]]
[EX A]:
[-63, 95, 79, -1, 41, 86, 8]