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: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]

SOLUTION: [-92, 90, 8, 74, -126, 6, 7, -86]

PROBLEM: [[-70, -183, -171, 49, -87], [-53, -85, -127, -81], [-62, -55, -77, -17, -96, -186]]

SOLUTION: [49, -53, -17]

PROBLEM: [[-119, -67, -88, -38, -144, -155], [-186, -16, -184, 39], [71, 24, -23, -42, -183, 80], [72, -51, 68, -76]]

SOLUTION:
[-38, 39, 80, 72]