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]: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]
[EX A]: [52, 76, 70, 93, 26, 99, 12, 94]

[EX Q]: [[-60, -15, -145, -17, -184, -199], [-146, -105, 64, -192, -170, 17, 69]]
[EX A]: [-15, 69]

[EX Q]: [[20, -99, 30], [-131, -126, 91, 75, 99, 80], [6, 27, -111, -45], [-155, 47, -163, -1, -163, 19], [-195, 40, -198, -180]]
[EX A]:
[30, 99, 27, 47, 40]