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: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

SOLUTION: [85, 82, 95, -111, 24, -112, 65, 65, 16]

PROBLEM: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]

SOLUTION: [83, 87, 54, -18, 51, -13]

PROBLEM: [[-107, -89, -92, -87, -116, -43, -62], [-56, 74, -49, -91, -73, -55, -104], [-7, -97, -116, -166, 20, -27, -50], [59, 8], [-121, -20], [-104, -27, -86], [-72, 47, -184, -32, -150, -124, 96], [-140, 54, -92, -3, -13, 96, -16], [-38, -86, -153, 85]]

SOLUTION:
[-43, 74, 20, 59, -20, -27, 96, 96, 85]