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: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]

SOLUTION: [34, 39, 62, 66, 38, -85, -2, -53]

PROBLEM: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]

SOLUTION: [39, 6, 91, -7, 52, 99]

PROBLEM: [[-182, -45], [-199, 70, -115, 93, -141, -109], [-102, 73, 75, -162, 16], [16, -179, -83, -142], [-167, -163, -97, -101], [-134, -190, -169, -170, 55, 66]]

SOLUTION:
[-45, 93, 75, 16, -97, 66]