TASK DEFINITION: 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.
PROBLEM: [[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]]

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

PROBLEM: [[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]

SOLUTION: [92, 50, -48, 70, 50, 30, 14, 7, 62]

PROBLEM: [[73, -87], [5, -57], [-34, 40, 29, -42, 32, 14], [-162, 21, -128], [-143, -94, -135, 60, -102, -121]]

SOLUTION:
[73, 5, 40, 21, 60]