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: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]

SOLUTION: [76, 29, 94, 94]

PROBLEM: [[50, -18, 75, -179, 70, -26], [-188, 78, -43, -66, -151], [80, 66, -61, -114, -13, -27, 95], [-196, 64, 61, 86, -178, 35, -195]]

SOLUTION:
[75, 78, 95, 86]