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: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]

SOLUTION: [79, 95, 82, 66, -11]

PROBLEM: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

SOLUTION: [78, -56, -80, 89, -112, 49, -93, 91, -94]

PROBLEM: [[64, -60, -85, 12, -158, 23], [-122, -55], [-63, 62, -139, 3, -134, -54], [-83, -152, -132, 28, -97, -40]]

SOLUTION:
[64, -55, 62, 28]