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: [[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]

SOLUTION: [86, 56]

PROBLEM: [[-111, -54, -11, -97, -137, 82], [63, -197, 31]]

SOLUTION: [82, 63]

PROBLEM: [[59, -35, -55], [-140, -132], [-5, -81, -97, 87, -18, -107], [-60, -165, 80, -66, 85], [-12, -1, -33, -111, 84, -156], [22, -92, -122, 82, -103]]

SOLUTION:
[59, -132, 87, 85, 84, 82]