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: [[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]

SOLUTION: [66, 78, -6, 42, 66, 42]

PROBLEM: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]

SOLUTION: [97, 23]

PROBLEM: [[20, -58, -23, -148, -80, 24], [-180, 27], [79, -107, -15], [-142, -81, -20, -81]]

SOLUTION:
[24, 27, 79, -20]