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: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

SOLUTION: [75, 57, 75, 20, -95, 20]

PROBLEM: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]

SOLUTION: [95, -43, 91, 90]

PROBLEM: [[-11, 57, -36, -116, -133, -80], [40, -23, -114, -193, -131, -88], [38, -47, -138, 43, 49], [-3, 88, -107, 52], [-103, 58, 100, -173, -137], [-36, 44, -180, 49, -77, 16, -132], [-93, -163, -113, -24], [-92, 63, -31, 58, 99, -90, -76]]

SOLUTION:
[57, 40, 49, 88, 100, 49, -24, 99]