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: [[-20, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]

SOLUTION: [63, -33, 43, 68]

PROBLEM: [[-106, -87, -48, -151, -158], [37, -16, -44, -111, -9, 24], [77, -42, 54, -105, -26, 78, 55], [-60, -1, -86, 94, -187, -90], [-163, -119], [79, -109, -183, -28], [23, 3, 43], [49, -109, -5, -47, -196], [7, -35, 95, -85, 99, -86, -22]]

SOLUTION: [-48, 37, 78, 94, -119, 79, 43, 49, 99]

PROBLEM: [[22, 51, 17, 93, -53, 19], [-86, -139, -159, -120, -130], [-2, 29], [0, 85, -17, -135, -73], [-165, -61, -161, -194, -190, -87, 44]]

SOLUTION:
[93, -86, 29, 85, 44]