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: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]

A: [57, 40, 81, 17, 4]
****
Q: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

A: [94, -107, 43]
****
Q: [[-172, -163, -121, -186, -44, -131], [-92, 44, -114, -128, -112, -56], [71, 47, 87, 59, -58], [60, 79, -156, -17, -69, 18, -90], [-147, 50]]

A:
[-44, 44, 87, 79, 50]
****