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: [[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

SOLUTION: [33, 34, 68, -13]

PROBLEM: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]

SOLUTION: [89, 96, -69, 40, 90, 75, 99, 98, 41]

PROBLEM: [[29, -34, -151, 31], [-191, -14, -62, -85, -172, -101, -89], [69, -84], [51, -166, -38, -177, -6, 41, 30], [-148, -93, -73, 100, 53]]

SOLUTION:
[31, -14, 69, 51, 100]