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: [[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]

SOLUTION: [-26, -126, 23, 95, 100, 13]

PROBLEM: [[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]

SOLUTION: [59, 61, 74]

PROBLEM: [[-47, -73], [-138, -43, -83], [-57, -119, 38, -70], [90, -46, -31], [40, -111, -140, -168, 13, 28], [-45, -69, 90], [-93, 18, -103, -7], [-7, -72, 2, -41, -40, -44, -97], [-20, -35, 78]]

SOLUTION:
[-47, -43, 38, 90, 40, 90, 18, 2, 78]