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: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

SOLUTION: [73, 26, 81, 48, 31, 25, 44, 31]

PROBLEM: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]

SOLUTION: [-19, 15, 24, 84, -138, 76]

PROBLEM: [[-87, 47, 12, 29, -50, 53], [-27, -35, -131], [-180, -120], [-131, -137, -128], [-24, -175, 70], [-116, 56, -70, 35, -50], [-40, 43], [-125, -194, 21, -147, -47, -72], [-34, 91, -19, -103, -105, -55, -17]]

SOLUTION:
[53, -27, -120, -128, 70, 56, 43, 21, 91]