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: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

SOLUTION: [37, 32, 34, -3, 97, 97, 68]

PROBLEM: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

SOLUTION: [22, -12, 60, 59, -8, 90]

PROBLEM: [[-77, -75], [-151, 70, -87], [8, -70, -6, 67, -124], [-49, -46, 15, 82, -45]]

SOLUTION:
[-75, 70, 67, 82]