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: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]

SOLUTION: [9, 29, 22, 85, 77, 75]

PROBLEM: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]

SOLUTION: [0, 22, 17, 48, 80]

PROBLEM: [[-180, -104, -150, -189], [8, -191, -95, -25, 59, 86], [-71, 94, -39, -146, -59, -103, 70], [-75, 35, -70], [66, 69, 96, -134, 5, -55, 69], [30, 90, -122, -137, -112, -114, -103], [-69, -173, -31, 11, -187], [52, -117, 89, -169, 59, -150], [-76, 78, -71]]

SOLUTION:
[-104, 86, 94, 35, 96, 90, 11, 89, 78]