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: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

SOLUTION: [79, 56, -1, 85, 89, 61, -62, 31]

PROBLEM: [[-89, -60], [75, -56]]

SOLUTION: [-60, 75]

PROBLEM: [[-11, -141, 64, 82, -12], [82, -23, 57, -112, -108], [-20, 16, -51, 68, -72, -89], [53, 1, -79], [3, -65, -141], [53, -136, -53, -27, -64, -111], [-122, -52, -171, -55]]

SOLUTION:
[82, 82, 68, 53, 3, 53, -52]