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: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]

SOLUTION: [-21, 86, 29, 100]

PROBLEM: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]

SOLUTION: [67, 26, 66, 99]

PROBLEM: [[-156, -2, 99, -91, 48, -174, -21], [43, -134, -84, -120, -107, 46, -131], [-138, -35, 54, 97, -58, 15], [-40, -61, -2, -13, 62, -116, 50], [4, -129, 50, -112, -17, -193, -104]]

SOLUTION:
[99, 46, 97, 62, 50]