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: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]

SOLUTION: [-12, 8, 76, 96, -36]

PROBLEM: [[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]

SOLUTION: [-30, 68, -15, 38]

PROBLEM: [[-182, -114, 36, -40], [-27, -156, 62, -119], [45, 76, -103, -47, -103, -1], [-80, -34], [-116, 96, -195, -64, -156, 3], [7, -196, -74, 5], [-185, -69, 64, -137]]

SOLUTION:
[36, 62, 76, -34, 96, 7, 64]