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: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

SOLUTION: [11, 41, 90, 72, 34, 56, 91, -133]

PROBLEM: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

SOLUTION: [67, 90]

PROBLEM: [[-75, 52, -148], [-132, 33, -150, 16, -136, 3], [46, -104, -142, 60, 53], [-122, -191, -175, -185], [81, 87, -170, -177, 75], [-54, 16]]

SOLUTION:
[52, 33, 60, -122, 87, 16]