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: [[79, -185, 24], [38, 8, 46, 27, -43, -100]]

SOLUTION: [79, 46]

PROBLEM: [[94, -71, -83, -154, -126, -62, -104], [-168, 66, 9, -12]]

SOLUTION: [94, 66]

PROBLEM: [[36, -57, -6, -48, 88, -72], [-169, -103, 0, -126, 38, -25], [45, -92, 68], [61, 25, 38], [-26, -167, -47, -192, 33, 22], [-112, -67, -196, -68, 66, -191, -92], [-18, -79, -28, 41], [-137, 6], [-173, -91, 93, -62, -155]]

SOLUTION:
[88, 38, 68, 61, 33, 66, 41, 6, 93]