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: [[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]

SOLUTION: [35, 82, 27, 58, -103]

PROBLEM: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]

SOLUTION: [76, -74, 73, 57, 41]

PROBLEM: [[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]

SOLUTION:
[-20, -7, 84, 98]