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: [[-54, -127, -178, -98], [7, 82, 69], [-159, -142, -82, -156, -100, 7], [-76, 88, -45, 41], [86, -169]]

SOLUTION: [-54, 82, 7, 88, 86]

PROBLEM: [[-110, 28, -163, -34, -127, 12, 88], [-112, -39, -65, 42, 65, 82], [-28, -160, -168, -173, 62, 1], [90, 10, 72, -158]]

SOLUTION:
[88, 82, 62, 90]