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, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]

SOLUTION: [46, 34, 80, 76, 68]

PROBLEM: [[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]

SOLUTION: [-68, 43, 91, 96, 85, 80]

PROBLEM: [[98, -86, -6, -132, -141, 60, -117], [45, 8], [14, 0, -84, 31], [35, -138], [-199, -143, -56, -184, -84], [48, -142, -63, -195, -137]]

SOLUTION:
[98, 45, 31, 35, -56, 48]