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: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]

SOLUTION: [67, 85, 90, 76, 81, 98, 94]

PROBLEM: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]

SOLUTION: [71, 71, -38, 60, 7, 97, 76]

PROBLEM: [[-146, -188, -51, -146, -106, 100, -121], [-17, -194, 95, 93, -187], [-182, -91, -190, -65, -48, 75, -91], [20, -71, -71, 50, -66, -11, -146], [-188, -11, -10, 57]]

SOLUTION:
[100, 95, 75, 50, 57]