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: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]

SOLUTION: [17, 69, 96, 75, 36, -151]

PROBLEM: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

SOLUTION: [92, 46, 25, 19]

PROBLEM: [[14, -58, 19, -161, 43, -126, -25], [5, 55, -47, -185], [-60, -39, -113, -81, -152, 67, 50]]

SOLUTION:
[43, 55, 67]