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: [[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]

SOLUTION: [93, 57, 98, 60, 15, -64, -9]

PROBLEM: [[-86, -6, -103], [25, 48, -56, -91, 82, 48], [-173, -185, -83, -60, 6, 55], [-195, -114, -76, 57, 11, -147]]

SOLUTION:
[-6, 82, 55, 57]