import heapq

def large_product(nums1, nums2, N):
    if not nums1 or not nums2 or N <= 0:
        return []

    nums1 = sorted(nums1, reverse=True)
    nums2 = sorted(nums2, reverse=True)

    max_count = len(nums1) * len(nums2)
    N = min(N, max_count)

    heap = [(-(nums1[0] * nums2[0]), 0, 0)]
    visited = {(0, 0)}
    result = []

    while heap and len(result) < N:
        neg_product, i, j = heapq.heappop(heap)
        result.append(-neg_product)

        if i + 1 < len(nums1) and (i + 1, j) not in visited:
            visited.add((i + 1, j))
            heapq.heappush(heap, (-(nums1[i + 1] * nums2[j]), i + 1, j))

        if j + 1 < len(nums2) and (i, j + 1) not in visited:
            visited.add((i, j + 1))
            heapq.heappush(heap, (-(nums1[i] * nums2[j + 1]), i, j + 1))

    return result