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]: [[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]
[EX A]: [93, 7, 60]

[EX Q]: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]
[EX A]: [97, -5, 47, -13, 95]

[EX Q]: [[4, -123, -158, -91, -141, -59], [-144, 8, -32, -172, 17, -165, -42], [61, -199, -100, 49, 76], [-44, -176, -51, -29, -118, -136], [-63, -171], [95, -120], [39, -100, 43, -160], [-200, -145, -109, -10, 62, -145], [85, -176, 65, 70]]
[EX A]:
[4, 17, 76, -29, -63, 95, 43, 62, 85]