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, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]

SOLUTION: [-26, 74, 56, 71]

PROBLEM: [[-85, -197, 23, -152], [-86, 62, 72, -58, 33], [-117, 76], [-195, -177, -170, 97], [30, 79, -50, 72, 54], [-23, 49, -16, -188], [32, 5], [-109, -31]]

SOLUTION: [23, 72, 76, 97, 79, 49, 32, -31]

PROBLEM: [[-179, -72, -77, 32, -5, -107, -16], [-61, 80, 73, -103], [80, 72, -165, -7, 35, -78], [43, 81], [36, -151, -101, 10, -92], [-75, -147, -168, 59, -55]]

SOLUTION:
[32, 80, 80, 81, 36, 59]