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: [[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]

SOLUTION: [44, 72, 91, 14, 85, 99, 81]

PROBLEM: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

SOLUTION: [18, 79, 47, 72]

PROBLEM: [[-123, -177], [-109, -86], [-58, -1, -182, 44, 16, -16, -73], [94, 41], [-32, -84], [-89, 10, 47, 48, 2]]

SOLUTION:
[-123, -86, 44, 94, -32, 48]