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: [[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: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

SOLUTION: [11, 41, 90, 72, 34, 56, 91, -133]

PROBLEM: [[-144, -62, 60, -152, -68, -185, 37], [17, -128, -90, 41, -115], [-50, 80, 32, -109], [88, -82, -148, -164], [-169, -110, -60, -117, -18], [16, -3, 8, -190]]

SOLUTION:
[60, 41, 80, 88, -18, 16]