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: [[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]

SOLUTION: [32, 26, 72, 53, 75, 58, 92, 44]

PROBLEM: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

SOLUTION: [-23, 94, 42, 34, 96, 77, 73, 60, -25]

PROBLEM: [[-63, 31, -16, 36, -35], [-33, -36, 90, 27, -130, -137, -164], [-108, -171, -50, -112, -136, -116], [-58, -123, 52, -73, -65, -35, -87], [-170, 10, -143], [-95, 98], [-57, 72, 38, 57], [-37, 70, 8, -171]]

SOLUTION:
[36, 90, -50, 52, 10, 98, 72, 70]