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: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

Answer: [21, -38, 99, 89, 40, 46, 69]


Question: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

Answer: [-76, -61, 22, 62]


Question: [[-160, -130, -189, -108, -65], [-146, 43, 87, -138, -94, 53, -10], [-187, 67, 68, 20, -162, -91, -36]]

Answer:
[-65, 87, 68]