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: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

SOLUTION: [94, -107, 43]

PROBLEM: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]

SOLUTION: [97, -5, 47, -13, 95]

PROBLEM: [[-39, -146, 37, 97, -159, -124], [-141, -103, -195, 22], [41, -182, -22, -36, -117, -27], [-160, -16, -61, -132, 88, -93, -186], [-94, -18, -68, -180, -159, 8], [-185, -170, 75, -183, -132, -62, -34], [-88, 65, -72, -1, -121, -120], [27, -52, -66, -149, -56, 7, 38], [-110, -78]]

SOLUTION:
[97, 22, 41, 88, 8, 75, 65, 38, -78]