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: [[-54, -127, -178, -98], [7, 82, 69], [-159, -142, -82, -156, -100, 7], [-76, 88, -45, 41], [86, -169]]

SOLUTION: [-54, 82, 7, 88, 86]

PROBLEM: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

SOLUTION: [-53, -98, 36]

PROBLEM: [[9, -109, -16, -124, -150, -93, 92], [-127, 87, 16, -83], [-85, -123, -143, -161, -91], [15, -69]]

SOLUTION:
[92, 87, -85, 15]