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: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

SOLUTION: [61, 73, 78, 71, -99, 88, -30]

PROBLEM: [[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]

SOLUTION: [14, -43, -3, 14, 56, 61, -19, 97, -14]

PROBLEM: [[56, 11, -180, -186, 8, -146], [-109, -5, -20, -18, 94], [34, -74, -40, -55, -66, -165], [78, 95]]

SOLUTION:
[56, 94, 34, 95]