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: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]

SOLUTION: [97, 24, -43, 79, 51, 72]

PROBLEM: [[-107, 41, 2, -56, -164, -190], [-61, -10]]

SOLUTION: [41, -10]

PROBLEM: [[33, -59, -49, -77, 79, -59, 82], [-28, -5, 83, 14, -146]]

SOLUTION:
[82, 83]