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: [[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]

SOLUTION: [-47, 0, -11, 6, 85, 50]

PROBLEM: [[-92, 66], [-124, -75, -170, -17, 20, -164]]

SOLUTION: [66, 20]

PROBLEM: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

SOLUTION:
[61, 77, 44, 93]