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: [[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

SOLUTION: [65, -105, 61, 82, 98]

PROBLEM: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]

SOLUTION: [86, 46, -128, 81, 40, 67]

PROBLEM: [[-89, 89, -154, -127, 93], [-23, -54, -92, -132, 66, -124, 0], [-97, 13, 90, -174, -98, -55, -48], [24, -135], [-186, -158], [86, -190, -41, 16, -19], [-60, -129, -46], [82, -18, -16, -81, -179, -66, 53], [-189, -81, -136, -60, -15, -79, -190]]

SOLUTION:
[93, 66, 90, 24, -158, 86, -46, 82, -15]