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: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

SOLUTION: [-53, -98, 36]

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: [[100, -73, 0, 53], [-94, -127, -29]]

SOLUTION:
[100, -29]