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: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

SOLUTION: [60, -36, 94, 68, 36, -64, 41]

PROBLEM: [[-42, -57, 13, -41], [45, -68, -199]]

SOLUTION: [13, 45]

PROBLEM: [[-184, -33, -148, 44], [33, -138, 94, -115, 23], [-109, 71, -131], [-166, -7, -102, 68], [-96, 59, -140, 31, -146], [-70, -182, 21, -47, -51, -95, -89]]

SOLUTION:
[44, 94, 71, 68, 59, 21]