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]: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
[EX A]: [82, -53, 34, 100, 65, 57, 65, 58, -101]

[EX Q]: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]
[EX A]: [42, -49, 94, 89, -73, 5, -41, 89]

[EX Q]: [[53, -125, -91, -88], [-150, -43, -12, -110], [-166, -195, -4, -63, -6], [-143, 42], [-78, -180, 58, -116, 40, -87]]
[EX A]:
[53, -12, -4, 42, 58]