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: [[-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: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]

SOLUTION: [25, 54, -45, 79, 96]

PROBLEM: [[-196, 98, -159, 76, -150, 4], [-111, -44], [-110, -37, 51, -159], [-81, -160, -8, 72, 53, 76], [43, 77, 73, -149, -146], [-104, -170, 56, 81], [-188, 26, -161, 4, 74, -139]]

SOLUTION:
[98, -44, 51, 76, 77, 81, 74]