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: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]

SOLUTION: [54, 44, 50, 12, 24, -28]

PROBLEM: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

SOLUTION: [45, 33, 26, 69, 89, 95, 57, -4]

PROBLEM: [[-118, -78], [-48, -77, -145], [56, 7, -125, -3], [-82, -42, -126, -62, -195, 48, 45], [47, -34, 94, -52, -37, -13], [74, -144, 41, 9, 52, -126]]

SOLUTION:
[-78, -48, 56, 48, 94, 74]