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: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]

SOLUTION: [21, 70, 64, 38, 64, -27]

PROBLEM: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]

SOLUTION: [-111, 83, -8, 92, 55, 91, 70]

PROBLEM: [[67, -191, -21, -85, 37, -138], [-174, 43, 54, -153]]

SOLUTION:
[67, 54]