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: [[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]

SOLUTION: [97, 25, 45, 51, -113, -56, 41, -40, 74]

PROBLEM: [[11, 10, -180, -124, -192, 98], [86, -172, -162]]

SOLUTION: [98, 86]

PROBLEM: [[-10, 7], [9, -176], [-45, -34, -61], [49, -167], [23, 31, 20, -192, -166], [-188, -165, -158, -101, -33, -164, -185], [-105, -168]]

SOLUTION:
[7, 9, -34, 49, 31, -33, -105]