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, 87, 9, -146, -184], [97, -169, -21, 52, 16, -182, -6], [-60, -2, -147, 55], [-111, -154, -41, 37, -97, -139, -111], [33, -113, -106, -92], [-13, 49, 66, -121, 61, -129, -124], [72, -107, -192, 86]]

SOLUTION: [87, 97, 55, 37, 33, 66, 86]

PROBLEM: [[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]

SOLUTION: [83, 77, 52, 97, 49]

PROBLEM: [[-26, 59, -57, 28, 64, -102], [56, -96, -15, -83, 92, -33, -20], [-194, 38, -125, -113], [83, 42, -29, 73], [-181, 70, -13, -200, 81, -133, -197], [5, -165, -97, -146]]

SOLUTION:
[64, 92, 38, 83, 81, 5]