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: [[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]

SOLUTION: [96, 94]

PROBLEM: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]

SOLUTION: [97, -35, 7]

PROBLEM: [[89, -136, 67, 24, -184, 12], [38, -186], [70, -74, -38, -83, 47, 38], [60, -72, 8, -17, 44, 86], [-45, -26, 30, -192, -84], [-187, -84, -148, -116, -124, -108, 84], [-56, -2, 26, -67, -80, -106], [-166, -111, 10, -200, 77, 20, -80]]

SOLUTION:
[89, 38, 70, 86, 30, 84, 26, 77]