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: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]

SOLUTION: [78, 53, 93, 86, -31]

PROBLEM: [[-61, -44, -78, -169, 47, -84, -59], [-160, -114, -11, -9], [6, -104, -47, 76], [-118, 22, -171, 8, 27, -42], [25, -74, 45, -171, -64, -157, -112], [-1, -17, -46, -19, 26], [-11, -75, -166, -127, -34, -141], [85, -121, -101, 51, -41, 58, -139], [-122, 67, -116, 13]]

SOLUTION:
[47, -9, 76, 27, 45, 26, -11, 85, 67]