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, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]

SOLUTION: [96, 94]

PROBLEM: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

SOLUTION: [-53, -98, 36]

PROBLEM: [[-27, -76, -91, -24, 55, -161], [-46, 64, 22, 35, -19, -137, 45], [52, 8, 85, -129, -92, -137, -87], [-57, -22, 33, -84, -114]]

SOLUTION:
[55, 64, 85, 33]