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: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]

SOLUTION: [-57, 95, 65, -1, 100, 55, 31, 94]

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: [[69, -109, 29, 18, -3, -162, -10], [-177, -17, 81, -49, 33], [-187, -180, -10, -19], [-26, 21, -90, -162, 52, -36, 5], [-166, -134, -151, 3, -38, -58, -115], [93, 66, -160, -4, -83, -163]]

SOLUTION:
[69, 81, -10, 52, 3, 93]