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: [[-35, -72, -53, -9, 95, 58, -108], [-185, 72, -32, -90], [-117, -124, -172, 52, -37, -183], [-160, -193, -149, 25, -2], [-132, -182, -85], [-69, 39, -167, 57, -132, 13, 43]]

SOLUTION: [95, 72, 52, 25, -85, 57]

PROBLEM: [[79, -185, 24], [38, 8, 46, 27, -43, -100]]

SOLUTION: [79, 46]

PROBLEM: [[29, -123, -29, -152, -138], [6, -100, -42, -125], [-93, -172, -79, -188, -165, -131], [17, 10, -197, 71, 77, -62], [-94, -83, -62], [-95, -29, -10, -123, 83], [-197, 66, -89]]

SOLUTION:
[29, 6, -79, 77, -62, 83, 66]