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.
--------
Question: [[-42, -87], [-101, -39, -128, 73, -16], [85, -168], [-166, -107, -135, -139, -35, 76]]

Answer: [-42, 73, 85, 76]


Question: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]

Answer: [18, 84, -83, 96, -52, 90, 76]


Question: [[-13, 20, 20, -181, 23], [-185, -94, -104, 0], [-138, 49], [-1, 49, -178, -114, -31], [-189, -133, -156, 12, -24, -150, -168], [-33, 67, -170, -142]]

Answer:
[23, 0, 49, 49, 12, 67]