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: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]

SOLUTION: [-121, 80, 98, 56, -17, 10, 55]

PROBLEM: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

SOLUTION: [-66, -6, 91, 69, -24, 72]

PROBLEM: [[-50, -93], [-51, -113, 92, 63, -168, 49], [34, -164, 45, 25, 5, 13, 38], [-89, -158, 91], [71, -28], [92, 9, -143, 67, 62, 86, -22], [44, -136, -199]]

SOLUTION:
[-50, 92, 45, 91, 71, 92, 44]