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: [[56, -4, -191, -182], [47, -70, -154], [-16, -195, -67, -196, -12]]

SOLUTION: [56, 47, -12]

PROBLEM: [[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]

SOLUTION: [35, 82, 27, 58, -103]

PROBLEM: [[-89, -56, -10, -48, 18, -194, 32], [-66, 58, 11, 32], [-30, -38, -3, 5, 93, 57]]

SOLUTION:
[32, 58, 93]