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]: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]
[EX A]: [-18, 95, 50, 81, 49, 91, 94, 59]

[EX Q]: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
[EX A]: [99, 32]

[EX Q]: [[-127, 8, -171], [54, 41, -90], [-17, -66, -134, 80, -179], [-44, -109, 73, -122, 19, -19], [-58, 90, -25, 9, -188, 30], [100, -53, 10, -123], [65, 87, -123, -165, 28, -157, 46], [76, 94, -82, -54, -80], [-83, -128, -16, 67, -175]]
[EX A]:
[8, 54, 80, 73, 90, 100, 87, 94, 67]