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: [[-1, 80, -4, 63], [-191, -139, 22, 31, -145], [-154, -165, 43, -190]]

SOLUTION: [80, 31, 43]

PROBLEM: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]

SOLUTION: [95, -43, 91, 90]

PROBLEM: [[-27, -143, 7, -17, 90], [-1, -96, 2, -98, 76, 14, -74], [55, 80, 66, 27, -12, -190]]

SOLUTION:
[90, 76, 80]