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: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]

SOLUTION: [-12, 8, 76, 96, -36]

PROBLEM: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

SOLUTION: [98, 30, 96, 87, 96, 67, 53]

PROBLEM: [[55, -39, -84, -66, 5, 23], [-173, -51, -26, 34, -116, -65, 93], [49, -57], [76, -147, -83, -106, -6, 24, 70], [33, 97, -157, -105, -64, -158], [-113, -82]]

SOLUTION:
[55, 93, 49, 76, 97, -82]