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: [[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]

SOLUTION: [-68, 43, 91, 96, 85, 80]

PROBLEM: [[-54, -80, 72, -155], [-182, 65]]

SOLUTION: [72, 65]

PROBLEM: [[53, 97, 54, -2, 98], [83, -157, 21, 34, -22, -179, -28], [-77, -46], [-145, -48, -17, -144, -5, -127, -152], [-96, -151, -130, -105], [-6, 20, -37], [-92, -143, 15, 83, 52]]

SOLUTION:
[98, 83, -46, -5, -96, 20, 83]