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: [[-101, -168], [17, 42, -110, 20], [83, -36]]

SOLUTION: [-101, 42, 83]

PROBLEM: [[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]

SOLUTION: [77, 20, 78, 69, 77, 24, -5, 45]

PROBLEM: [[-11, -38], [-59, -160, -69]]

SOLUTION:
[-11, -59]