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: [[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]

SOLUTION: [-6, 51, 71, 98, -30, 26]

PROBLEM: [[-125, -150, -5], [-100, 46, 65, 64, 5, -15, -82]]

SOLUTION: [-5, 65]

PROBLEM: [[36, -17, -53, -125, 25, 78], [-121, 86, -9, 16, 22, 36], [61, -99], [-55, -38], [70, 6, -125, -194, 30], [-10, -62, -22], [83, -172, -107, -19], [86, 88, -93], [-101, -11, -19, -101, -21, 28, -168]]

SOLUTION:
[78, 86, 61, -38, 70, -10, 83, 88, 28]