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: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]

SOLUTION: [-137, 8, 71, 30, 12]

PROBLEM: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

SOLUTION: [82, -35, 37, 86, 1, 46, 99]

PROBLEM: [[-182, -143, -92, -34, -175, -121, -5], [58, 52, -28, 72, -39], [-50, -60, -104], [-27, -98], [-26, 14, -106, -101, 34, -75, -130], [-104, 45, -113], [23, 83, 88, 27, -135, 28], [-171, -128, -158, 38]]

SOLUTION:
[-5, 72, -50, -27, 34, 45, 88, 38]