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: [[79, -185, 24], [38, 8, 46, 27, -43, -100]]

SOLUTION: [79, 46]

PROBLEM: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]

SOLUTION: [-26, 31, -27, 94, 69, 47, 55, -8]

PROBLEM: [[-185, -146, -74, 16, 30, 37], [-11, -160, 48], [-87, -75, -86, -170], [10, -102, 31, -13, -81], [-95, -134, 8, -98, -155, 18, -142], [-184, -11], [-122, 80, -186, 19, -196, -109]]

SOLUTION:
[37, 48, -75, 31, 18, -11, 80]