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: [[-4, -117, -177, -28, -87, -48], [-168, -118, 18, 12, -108, 83, -91]]

SOLUTION: [-4, 83]

PROBLEM: [[65, -176], [77, 97, -198, -72, -92, 10], [-147, 17], [-49, 33], [-49, -27, -78, -184, -94, -146, 14], [-193, -145, -81, -38, -161]]

SOLUTION: [65, 97, 17, 33, 14, -38]

PROBLEM: [[98, 62, -166, -178, 46], [-27, -122, -31, -61, 97, -61], [-190, 27, 49, 16, -176], [-3, -149, 66, -155, 27, 39, 84], [-82, 65, 53, 50], [69, -152, -96, 54, -92, 73, -10], [-159, -194, 78, -112, -191, -151, -129], [-23, -142, 74]]

SOLUTION:
[98, 97, 49, 84, 65, 73, 78, 74]