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: [[-82, 59, 16, -170, -136, 39], [-40, -166, -55, 98, 96], [87, 75, 43, 27, -133], [-70, -62, 32, 79, -66, -138, 43]]

SOLUTION: [59, 98, 87, 79]

PROBLEM: [[49, -82, -118, -198, 28, -171, -74], [-72, -35, -32, -120, -131, 24], [-92, -135], [-71, -91, 14, 80, -124, 75], [-160, -54, 19, -151, -90], [18, 48, -175, 93, 48], [100, 54, 64, -82, -190, -199], [-21, 42], [-112, 84, -196]]

SOLUTION: [49, 24, -92, 80, 19, 93, 100, 42, 84]

PROBLEM: [[-127, 67, -45, -93, 68], [5, 70, -77, 36], [-42, 3, 42, -53, -158]]

SOLUTION:
[68, 70, 42]