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: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]

SOLUTION: [81, -36, 35, 65, 59, -31, 33, 89, 98]

PROBLEM: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]

SOLUTION: [99, 1, 16, 19, 62]

PROBLEM: [[99, -104, 63], [-3, -47, 12], [100, -181, -64], [-3, -174, -132, 10], [-75, 25, -21, 48, -197, 68, 62], [38, -92], [-171, -138, -142, 71], [-150, -54, -141, 42, -143, 6, 16]]

SOLUTION:
[99, 12, 100, 10, 68, 38, 71, 42]