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: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]

SOLUTION: [56, -87, 97, 5, 75, 100, 39, 38]

PROBLEM: [[20, -141], [-153, 62, 13, -129], [-197, 78, 14, -101], [40, -136, -81, -138], [-182, 84], [47, -184, -16], [5, -28, -3, -174, -139], [91, -121, -61, 55, 42]]

SOLUTION: [20, 62, 78, 40, 84, 47, 5, 91]

PROBLEM: [[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]

SOLUTION:
[4, 95, 28, 51, -75, 76, 64, 9]