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: [[-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: [[-112, -32, 5, -133], [-57, -42, -9, 22, 64]]

SOLUTION: [5, 64]

PROBLEM: [[-48, 68, -52, -49, -112, -163, -151], [0, -6, 87, -200], [-29, 83, -96, -184, -31], [17, -47, -49, -194], [57, -111, -60, 31, 41, -98, -85], [-61, -19, -66, 55, 16]]

SOLUTION:
[68, 87, 83, 17, 57, 55]