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: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]

SOLUTION: [20, -71, 9, 97, 46, 17, 90]

PROBLEM: [[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]

SOLUTION: [46, 78, 79, -22, 96]

PROBLEM: [[95, -53, 3], [45, -143, -172, 59, -155, -187], [-48, -113, -187, -156, 36], [13, 49]]

SOLUTION:
[95, 59, 36, 49]