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: [[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

SOLUTION: [98, -25, 42, -101, 76, 92, 82, 53, 53]

PROBLEM: [[-9, -79, 44, -146], [-82, -120, 65, 77, -98], [5, -79], [-158, -151, 85, 28, 96, 16], [64, -169], [-104, -177, 24, -113, -17], [55, -135, 52]]

SOLUTION:
[44, 77, 5, 96, 64, 24, 55]