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: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]

SOLUTION: [97, -5, 47, -13, 95]

PROBLEM: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

SOLUTION: [21, -38, 99, 89, 40, 46, 69]

PROBLEM: [[-65, 69], [-88, -172, 2, -71, 13, -152, -96], [-84, -190], [-192, -196, -29, 19, -34, -104, -89], [17, 75, -21, -132], [-33, -178, 32, 80], [-140, -14, -184, 48, -135, -49, -102], [97, -74, 41, -132], [-138, 39]]

SOLUTION:
[69, 13, -84, 19, 75, 80, 48, 97, 39]