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: [[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]

SOLUTION: [39, 94, -9, 23, 53, 92, 72, 15, 38]

PROBLEM: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]

SOLUTION: [-92, 90, 8, 74, -126, 6, 7, -86]

PROBLEM: [[-42, 41, 67, -103, -83], [-110, 93], [-98, -152], [47, -108], [-161, 100, -10, -117, -126, -123], [-169, -28, 79, 4, -166], [12, -42, -150, -11, -5], [0, 75, 4, 50]]

SOLUTION:
[67, 93, -98, 47, 100, 79, 12, 75]