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: [[-107, 41, 2, -56, -164, -190], [-61, -10]]

SOLUTION: [41, -10]

PROBLEM: [[-102, 46, -150, -150], [-151, -137]]

SOLUTION: [46, -137]

PROBLEM: [[44, 19, -140, 8, -106, -39, -199], [-139, -153, -118, 36], [-64, -87, -59, 7, 98, -24, -133]]

SOLUTION:
[44, 36, 98]