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: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]

SOLUTION: [-42, 88, 91, -13, 34]

PROBLEM: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]

SOLUTION: [81, -36, 35, 65, 59, -31, 33, 89, 98]

PROBLEM: [[30, 47, -195, -62, 84], [-78, -172, 19], [-155, -199], [87, -11, -103, 6, 6, 6, -11], [7, -163, -114, -106, -195, -102], [-18, 28, -36, -171]]

SOLUTION:
[84, 19, -155, 87, 7, 28]