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: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]

SOLUTION: [8, -11, -47, 24, 61, -67, -11, 70, 10]

PROBLEM: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]

SOLUTION: [12, -10, -48, -35]

PROBLEM: [[-20, 85, -131, -163, -164, -166, -93], [-141, 84, -91, 63, -175], [-171, -56], [-188, -104, -150], [-190, -195, -171]]

SOLUTION:
[85, 84, -56, -104, -171]