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: [[97, -135, -83, -157, 30], [-24, 59, 42, -84, 64, -74], [6, 50, -174], [-170, 93, -66, -136]]

SOLUTION: [97, 64, 50, 93]

PROBLEM: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

SOLUTION: [65, 53, 72, -30, 85, 38]

PROBLEM: [[78, -27, -122, 87], [-62, -118, -122, -132, 11, -187, -175], [-68, 7, -51, 71, 26, -21], [-100, -54, -61, -2, -126], [-115, -3, -154, 5, -174, -131, 77], [-74, 35, -113, -85, -76, -191, 1], [78, 60], [-26, -10, -152, -155], [-200, 9, 68, -59, -170, 81, -39]]

SOLUTION:
[87, 11, 71, -2, 77, 35, 78, -10, 81]