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: [[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

SOLUTION: [33, 34, 68, -13]

PROBLEM: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]

SOLUTION: [25, 32, 86, 96, -33, 84, 93]

PROBLEM: [[-26, -154], [-119, -123, 44, 5], [6, -56], [52, -155, 16, -70, 18, -44], [-119, -174, -170, -65, -163], [-142, -11, -87, -158, 15], [-53, -79, -100, 27, 23], [100, 57, 6, -56, -129, -20, -86], [-177, 43, -138, -30, 42, 47]]

SOLUTION:
[-26, 44, 6, 52, -65, 15, 27, 100, 47]