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: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]

SOLUTION: [80, 83, 88, -39, 77, 60, -16, 93, 86]

PROBLEM: [[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]

SOLUTION: [-134, 11, 21, 86, -74, 18, 81, 92, 79]

PROBLEM: [[20, -123, -74], [97, -131, -3, -79, -90, -168, -5], [-119, 13, -164, 78, -95], [66, 12, -20, 10, -146, -104], [-113, -91, 1, -161, 21, -58, -163]]

SOLUTION:
[20, 97, 78, 66, 21]