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: [[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]

SOLUTION: [78, 86, -72, -153]

PROBLEM: [[-62, 3, -118, -146, 75, -150], [3, -126, 64, -23], [64, 28], [-90, 57, 97, -92, -179]]

SOLUTION: [75, 64, 64, 97]

PROBLEM: [[-128, -192, 62, 13, -117, -139, -40], [-64, -49, -21, 68, 97], [-131, 90], [-84, -144, -200], [91, 48, 39, -102], [13, -141, -7, -179, -47, -4], [-75, 64, -199], [-13, -177, -35, 34, -10]]

SOLUTION:
[62, 97, 90, -84, 91, 13, 64, 34]