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: [[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]

SOLUTION: [100, 71, 38, 11, -1, 13, 79, 30]

PROBLEM: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

SOLUTION: [93, -100, 50, 56, 90, -87, 74, 82, 49]

PROBLEM: [[-164, -152], [29, 59, -151, 99, -22], [59, -144, -105, -41, -51, -198, -58], [-140, -62, 48, -47, 15, 17, 20], [45, -97, 92, 48], [-89, -157, -30, -145], [-51, -148], [17, -128, -132, -57, -102]]

SOLUTION:
[-152, 99, 59, 48, 92, -30, -51, 17]