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: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

SOLUTION: [82, -35, 37, 86, 1, 46, 99]

PROBLEM: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

SOLUTION: [57, 80, -20, -50, 8, 64]

PROBLEM: [[-85, 10, -97, -91], [36, 71, -33, 43, -135], [35, -30, -8], [-104, 25, 78, 42]]

SOLUTION:
[10, 71, 35, 78]