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: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]

Answer: [79, 0, -71, 32, 98, 26, 20, 70]


Question: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]

Answer: [86, 46, -128, 81, 40, 67]


Question: [[-25, 56], [-67, -131, -147, 95], [-171, -175, -135, -47, -174], [-78, 33], [58, -146, -154], [-162, 62, -91, -157]]

Answer:
[56, 95, -47, 33, 58, 62]