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: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]

Answer: [67, 26, 66, 99]


Question: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

Answer: [-66, -6, 91, 69, -24, 72]


Question: [[-97, -159, 49, 93, -115, -180], [-2, 38, 70, -11], [-50, 74], [57, 38, -101], [-138, -97, 64], [-68, 16, 43, -97, -32, -81]]

Answer:
[93, 70, 74, 57, 64, 43]