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: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]

SOLUTION: [79, 95, 82, 66, -11]

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: [[-16, -43], [-16, -28, 22, -155, 50, -109, -158], [-143, -69, 90, 90, 64], [22, 40, 7, -35, -135, 39, -2]]

SOLUTION:
[-16, 50, 90, 40]

