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: [[77, -10], [-44, 22, -89], [83, -197, -135], [94, 7, -166, -111]]

SOLUTION: [77, 22, 83, 94]

PROBLEM: [[-186, -165, -35, 72], [-40, 61, -23, 87, -158, -156], [-84, -199, -20, 69, -19], [6, -168, 14, 37, -194, -84], [-159, -182, -60, 37, -27, -26, -75]]

SOLUTION:
[72, 87, 69, 37, 37]