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: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]

SOLUTION: [76, 29, 94, 94]

PROBLEM: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]

SOLUTION: [79, 83, 25, 75, 98, 92, 84, 92, 28]

PROBLEM: [[60, -106, -167, -4, 86, 37, -43], [0, 2, -26, -131, -172], [-106, 0, -110, -30, 45], [-193, -193, -187, 73, -47, -192, -94], [-104, -54, -119, 14, 76, -156]]

SOLUTION:
[86, 2, 45, 73, 76]