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: [[-53, 27, -29, 53, -93], [-148, -197]]

SOLUTION: [53, -148]

PROBLEM: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]

SOLUTION: [23, 99, 54, 29, 98, 95, 65, 88, 51]

PROBLEM: [[58, -96, -99, 94], [-152, -113, 41, 76], [36, 65, -196, -82], [-113, -189, -78, -71], [-21, -89, 44], [45, 97, 58], [-185, -83, -119, -72, 22]]

SOLUTION:
[94, 76, 65, -71, 44, 97, 22]