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: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]

SOLUTION: [20, -71, 9, 97, 46, 17, 90]

PROBLEM: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

SOLUTION: [91, 53, 82, -9]

PROBLEM: [[78, 92, -37, -88, 48, -101, 35], [-186, 99, 89, -177, 55], [-12, 54, 0, 6, -178], [-57, -60, 3, -129, -155], [-190, -92, -150, -112, -130, -115, -169], [20, 35, -63, 21]]

SOLUTION:
[92, 99, 54, 3, -92, 35]