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: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]

SOLUTION: [-19, -112, 30, 59, 65, -7, -16, 86, 39]

PROBLEM: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]

SOLUTION: [52, 80, 98, 38, 69, 81, 8, 64]

PROBLEM: [[-30, 24, 35, -134, 24, -106, -141], [33, -35, 90, -196, -119, -114, -108]]

SOLUTION:
[35, 90]