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: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

SOLUTION: [25, 59, -59, 90, 68, -84]

PROBLEM: [[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]

SOLUTION: [72, 36, 32, 2, 44, 89]

PROBLEM: [[-113, -157, -151, -54, -169, -18, 77], [-80, -85, 66, -6, -26], [68, -21, 76, -22, -167, -123, 39], [-174, -67, -197, -149, 65, -16], [-197, -109, -133, -39, 70], [-123, -71, -39], [-100, 81, 73, 38, -80], [67, -199], [-48, -59, -108, -139, 15, -197]]

SOLUTION:
[77, 66, 76, 65, 70, -39, 81, 67, 15]