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: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]

SOLUTION: [97, -5, 47, -13, 95]

PROBLEM: [[65, -176], [77, 97, -198, -72, -92, 10], [-147, 17], [-49, 33], [-49, -27, -78, -184, -94, -146, 14], [-193, -145, -81, -38, -161]]

SOLUTION: [65, 97, 17, 33, 14, -38]

PROBLEM: [[-109, -189, -173, 12, -164], [-99, 64, 15], [-48, -90, 94, -161], [-171, 41, -96, -101, -40, 27], [-91, -64, 27, 46, 90], [-41, -173]]

SOLUTION:
[12, 64, 94, 41, 90, -41]