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: [[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]

SOLUTION: [-41, 13, 43, 88, 15, 32, 33, 57]

PROBLEM: [[-81, -174, -79], [6, -131, -75, 40]]

SOLUTION: [-79, 40]

PROBLEM: [[20, -168, 32, -200], [-26, 41, -22, -110, -33], [-81, -56, -2, 16, -17, -191], [-50, 82, -43, 56, 84], [48, 98, -143, 76, -53], [-101, -139, 24, -163, 91, 93], [-153, 41, 59], [-17, 21, -49, 97, 68, -182]]

SOLUTION:
[32, 41, 16, 84, 98, 93, 59, 97]