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: [[-169, -104, 48, -186, 57, -108], [-36, 65, -62, -91, 58, 55, -136], [-107, -18], [-52, -153, 45, -119, -105, 18], [65, 58, -15, -79, 82, -93], [-178, 96, -64], [44, -116, -197, -109, -15], [-161, 23, -115, -148, -175, -189, -175]]

SOLUTION: [57, 65, -18, 45, 82, 96, 44, 23]

PROBLEM: [[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]

SOLUTION: [-61, -151, 63, -48, 2, 66]

PROBLEM: [[-21, -163, -76, -128, -43, -32, 10], [76, -192, -82, -4, -73, 26], [-56, 16, 15], [-198, 70, 35, 55, -7, -135], [-12, -138, 95]]

SOLUTION:
[10, 76, 16, 70, 95]

