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: [[-6, 41, -190], [-47, 89], [29, -17, -135]]

SOLUTION: [41, 89, 29]

PROBLEM: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]

SOLUTION: [8, -11, -47, 24, 61, -67, -11, 70, 10]

PROBLEM: [[98, -112, 93], [-81, -70, 92, -191, -109], [-53, -93, 22], [27, 88], [-155, -26], [-45, 39]]

SOLUTION:
[98, 92, 22, 88, -26, 39]