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: [[89, 48, 81, 67, 22, 14], [-78, 84]]

SOLUTION: [89, 84]

PROBLEM: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

SOLUTION: [21, -38, 99, 89, 40, 46, 69]

PROBLEM: [[-90, -67, 78, -74, -8, -127, -71], [67, 73, -71, 56, -138], [-161, -154, -145, 26, 13, 97], [91, 59, -122, -72, 7, 58], [-9, -121, 39, -148, 25, -57, 97], [3, 8, -174, -160], [86, -104, -187, -124, 55, -143, 46], [-196, -192], [51, -8, -1]]

SOLUTION:
[78, 73, 97, 91, 97, 8, 86, -192, 51]