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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

SOLUTION: [-55, 98, -27]

PROBLEM: [[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]

SOLUTION: [59, 61, 74]

PROBLEM: [[-116, -196, 77], [-56, -15], [-79, -4, -109, -13, -103, -190, -9], [-33, -35]]

SOLUTION:
[77, -15, -4, -33]