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: [[-53, 27, -29, 53, -93], [-148, -197]]

SOLUTION: [53, -148]

PROBLEM: [[-169, -104, 48, -186, 57, -108], [-36, 65, -62, -91, 58, 55, -136], [-107, -18], [-52, -153, 45, -119, -105, 18], [65, 58, -15, -79, 82, -93], [-178, 96, -64], [44, -116, -197, -109, -15], [-161, 23, -115, -148, -175, -189, -175]]

SOLUTION: [57, 65, -18, 45, 82, 96, 44, 23]

PROBLEM: [[27, 84, -149, 70, -74, -197, -189], [98, -172, -63, -10, -71, -95, -132], [20, -82], [-71, -198, 64, -32, 62, 11, -55], [-156, -103, 90], [-66, -134, 40, -71, -34], [81, 2, 68, -89, -61, 62], [-78, -166, -107, -147, -182, -157, -163]]

SOLUTION:
[84, 98, 20, 64, 90, 40, 81, -78]