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: [[7, 12], [-173, 15, -64, -64, -10, 54], [87, 73, -93, -48, -75, -135]]

SOLUTION: [12, 54, 87]

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: [[-168, -97, -120, 6], [15, 64, 98, -10], [41, 90], [72, -131], [-14, 10, -184, -12], [-79, -170, -17, -55, -104, -143], [-128, -144, -90], [92, -110, 56, -21]]

SOLUTION:
[6, 98, 90, 72, 10, -17, -90, 92]