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: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]

SOLUTION: [98, 56, 93, 13, 28, 59, 74]

PROBLEM: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

SOLUTION: [83, 79, 34, 49, 11, 75, -6, 67, -96]

PROBLEM: [[-8, -60, 52, 6, -179, -5], [-14, -172], [-197, 48, -72, 26], [6, -29, -123, -41, -85], [79, -140, 34, -168, 41, -194], [13, -134, 76, -4], [-113, -3]]

SOLUTION:
[52, -14, 48, 6, 79, 76, -3]