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: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]

SOLUTION: [53, 64, -34, 92, 22, 82, 85, 81, 43]

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: [[-29, -44, 44, -195], [-28, 67, 73], [54, 56, -200, -61, -184, -56, -132]]

SOLUTION:
[44, 73, 56]