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: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]

SOLUTION: [89, 47, 19, -36]

PROBLEM: [[-45, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]

SOLUTION: [100, 86, 87]

PROBLEM: [[-33, 48, -156, -198, -147, 9], [43, -107, -34, 30, -170, 99, -16], [65, 41, -173, 2], [-63, 47, 99, -140, 77, -130, -176], [97, -166]]

SOLUTION:
[48, 99, 65, 99, 97]