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, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

Answer: [-6, -59, 52, 14, 96, 37, 62]


Question: [[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]

Answer: [35, 82, 27, 58, -103]


Question: [[-174, -22, 98, 1, -165, -130, -134], [-140, 11, -72, 42, 13, -36, -193], [-20, -128, -85, 39], [8, -163, 94, 31, -119]]

Answer:
[98, 42, 39, 94]