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: [[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]

SOLUTION: [-43, 100, 61, 82, -28, 42]

PROBLEM: [[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]

SOLUTION: [84, 66, 12, 62, 32]

PROBLEM: [[39, 66, 55, 35, -103, -46], [-69, 81, 71, -25, 50, 83], [-118, -166, 54, 55, -188, -124, -67], [99, 10, -77, -38], [-62, -148, -114, -29, 45], [-189, 2, -66, -45, 13, -183, -125], [-115, -32, 14, -64], [-87, 97, -160, -10, 25]]

SOLUTION:
[66, 83, 55, 99, 45, 13, 14, 97]