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: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]

SOLUTION: [52, 8, 23, 54, -147, 61, 25, -44, 92]

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: [[-162, 1, -182, -111, -17, -41], [-18, -13, -21, -45, -56, -160, 23], [-108, -163, -71], [29, 36, 91, -138, -45, -79], [84, -176, 24, 99, 14, -42], [-167, -194, -130, -74, 69, 27, -187]]

SOLUTION:
[1, 23, -71, 91, 99, 69]