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: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]

SOLUTION: [-161, 92, 81, 1]

PROBLEM: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

SOLUTION: [60, -36, 94, 68, 36, -64, 41]

PROBLEM: [[-52, -69, -22, -103, -58], [-72, -22, -194, -119, -7, -104], [-126, -81, -192, -3, -8, 27], [-9, -112], [-38, -62, 92, 25, -22, -34, 6], [-75, -67, -19, 92, -76, -111, -56]]

SOLUTION:
[-22, -7, 27, -9, 92, 92]