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: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

Answer: [-6, 36, 29, -46, -41, 35]


Question: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

Answer: [-93, 50, 32]


Question: [[46, -35, -165, -41, 85, -86, 82], [-159, -56, -181], [-91, -188, 68, 49, -170, -149, -142], [-63, 73, -65, -12, -114], [-53, -109, -132, -63, -32], [-100, -54, -42, -12, -126], [-187, 16, -51, -153, 1]]

Answer:
[85, -56, 68, 73, -32, -12, 16]