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: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]

SOLUTION: [27, -10, 40, 78, 74, 22, 51]

PROBLEM: [[79, -185, 24], [38, 8, 46, 27, -43, -100]]

SOLUTION: [79, 46]

PROBLEM: [[-67, 74, 23, -125, 90, 90], [53, 78, -15, -93], [-71, -184, 57, -167, 64, -100]]

SOLUTION:
[90, 78, 64]