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: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]

SOLUTION: [81, -36, 35, 65, 59, -31, 33, 89, 98]

PROBLEM: [[-154, -106, -158, 36, 91, -3, -98], [-49, -85, 23, 14, -170, -169, -170], [-177, -51, -192, -57, 64, 83, -173]]

SOLUTION: [91, 23, 83]

PROBLEM: [[-81, -18, -14], [-48, -15, 7, -45, -29], [-31, -170, 4, 76, -175], [88, -62, 97, 25, 11, -44], [-112, -95, 54], [-151, -50, 50], [-114, -12, -103], [-193, 75]]

SOLUTION:
[-14, 7, 76, 97, 54, 50, -12, 75]