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: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

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

PROBLEM: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]

SOLUTION: [47, 27, 93, 67, 100, 70, 11, -5, -17]

PROBLEM: [[18, -38, -140, 17, 84, -138, 89], [-159, 94, -148, -142], [28, -58], [-116, -1, 43, 16], [-107, -98, -109, -41, -197, -79], [-65, -52, 73, -191], [-129, -36, -97]]

SOLUTION:
[89, 94, 28, 43, -41, 73, -36]