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.

Q: [[78, 3, -186, -60, -85, -7], [-3, -75, -30], [63, -19, -166], [-47, -88, 58], [-94, -36, -79], [-134, -2, 43, 87]]

A: [78, -3, 63, 58, -36, 87]
****
Q: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

A: [95, 60, 31, -122, 66, 84, 17]
****
Q: [[-104, -35, -12], [-145, -148], [-126, 77, 32, 47, -67, 44, -109], [-113, -114, 39, 1], [-51, -178, 4, -104], [93, -159], [10, -76, -4, -69, -147, -179, -85], [-43, -69, 36, -2, -72, 53, -136], [-85, -40, -120, -20, -12, 90]]

A:
[-12, -145, 77, 39, 4, 93, 10, 53, 90]
****