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]: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]
[EX A]: [-3, 50, -38, 51, 42, 54, 81, 76]

[EX Q]: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]
[EX A]: [10, -59, 99, 48, 18, 80]

[EX Q]: [[-128, 42, -121, -181, -134], [-192, -2, -100, -148, -181], [0, -31, -137, -162, -189, 42, -89], [-139, 77, -183, -11, -200], [71, 89, -172, -109, -125, -104, -88], [-150, 12, -47, 37], [79, 94, -135, -191], [-96, -57, -32, 30, -192, -68]]
[EX A]:
[42, -2, 42, 77, 89, 37, 94, 30]