
    Given two lists representing historical return rates from conservative and aggressive investment options respectively, find the N highest potential returns that could be achieved by pairing one conservative investment with one aggressive investment. Each return combination is calculated by multiplying the return rates of the paired investments, and the goal is to identify the top N most profitable combinations to recommend to clients.
    

    
def large_product(nums1, nums2, N):
    """
    Given two lists representing historical return rates from conservative and aggressive investment options respectively, find the N highest potential returns that could be achieved by pairing one conservative investment with one aggressive investment. Each return combination is calculated by multiplying the return rates of the paired investments, and the goal is to identify the top N most profitable combinations to recommend to clients.
    

    """
def large_product(nums1, nums2, N):
    """
    Given two lists representing historical return rates from conservative and aggressive investment options respectively, find the N highest potential returns that could be achieved by pairing one conservative investment with one aggressive investment. Each return combination is calculated by multiplying the return rates of the paired investments, and the goal is to identify the top N most profitable combinations to recommend to clients.
    

    """
    result = sorted([x * y for x in nums1 for y in nums2], reverse=True)[:N]
    return result