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: [[-3, -50, 28, 67, -12, 97, -98], [41, 88, 81], [44, -50, -49, -132, -161, 26]]

SOLUTION: [97, 88, 44]

PROBLEM: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]

SOLUTION: [95, 47, 66, 75, 33, 72, 9]

PROBLEM: [[-181, -6, -56, -22, -8, 53], [-137, -177, 49, -30, -107, 1, -78], [-25, -176], [85, 42, -125, -69, -107], [-105, 9, -111, -10, -12], [-35, -82, -146, -98, -6, -108, 76], [1, -175, -86, -147]]

SOLUTION:
[53, 49, -25, 85, 9, 76, 1]