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: [[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]

SOLUTION: [49, 68]

PROBLEM: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]

SOLUTION: [16, 13, 97, 19, 36, 10, 60]

PROBLEM: [[42, -49], [-101, -77], [-183, 20, 55], [-129, -74, -149, 35, 3, -51], [58, -49, -11], [95, -178, 72, -71], [53, -26], [-18, -132, 44, -181]]

SOLUTION:
[42, -77, 55, 35, 58, 95, 53, 44]