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: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]

SOLUTION: [-26, -3]

PROBLEM: [[-3, -50, 28, 67, -12, 97, -98], [41, 88, 81], [44, -50, -49, -132, -161, 26]]

SOLUTION: [97, 88, 44]

PROBLEM: [[-86, -94, -91], [17, -17, -121], [15, 72, -2, -176, -82, 17], [-70, -90, -138, -63, -174, -120, 60], [-56, -113, 93, 55, -22], [-140, 59, -101, 28, -125, -141], [-21, -35, 8, -176]]

SOLUTION:
[-86, 17, 72, 60, 93, 59, 8]