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: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

SOLUTION: [2, 72, 60]

PROBLEM: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]

SOLUTION: [67, 85, 90, 76, 81, 98, 94]

PROBLEM: [[92, 22], [-79, 62, -192, -88, 56, -149]]

SOLUTION:
[92, 62]