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: [[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]

SOLUTION: [77, 98, 57, 95, 68]

PROBLEM: [[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]

SOLUTION: [39, 94, -9, 23, 53, 92, 72, 15, 38]

PROBLEM: [[-107, -34, 57, -138, 12, 43, -153], [69, -110], [76, 56, 89, 89, -29, -199], [51, 15, 25, -14, -145], [63, -75]]

SOLUTION:
[57, 69, 89, 51, 63]