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: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]

SOLUTION: [-135, 19, -152, -91, 22, -152]

PROBLEM: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

SOLUTION: [100, 97, 77, 11, 52, 74, 99, -25, 8]

PROBLEM: [[35, -179], [22, -5, 84, -35, -50], [92, 39, -45, -119, -83, 93], [-143, -106, 1, -79], [-7, 20, -68, -40, 67, -66], [-5, -82, 94, 36, -171]]

SOLUTION:
[35, 84, 93, 1, 67, 94]