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: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]

SOLUTION: [49, -27, -132, 98, 73, 74]

PROBLEM: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]

SOLUTION: [91, -49, 89, 83, 92, -91]

PROBLEM: [[-34, -134, -158, -17, -1], [-190, -35, -21, 50, 92], [-179, -103, -113, -161, -79], [-119, -79, -132], [23, -19, -182, -68], [-9, 71, -62, 1], [-68, -176, -107, 55, 0, -33], [-181, -109, -80, -180, -10], [-24, -111, 24, 41, -98, 3]]

SOLUTION:
[-1, 92, -79, -79, 23, 71, 55, -10, 41]