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: [[-195, 0], [42, 19, -7], [-155, -76, -83], [-144, 19, 88], [-139, -174, -137, 59]]

SOLUTION: [0, 42, -76, 88, 59]

PROBLEM: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]

SOLUTION: [-7, 91, 93, 86, 39, -35, 74, 72, 17]

PROBLEM: [[-53, -134, 98, -194, 52], [-121, -101, -38, 45], [-83, 5, 25, 46], [99, -66, 5, 65, -86, -66], [-181, 43, -188, 64], [54, -16, -99, 39, -17], [44, 30, -30, -142, -106, -161]]

SOLUTION:
[98, 45, 46, 99, 64, 54, 44]