import heapq

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

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

    n1, n2 = len(a), len(b)
    total = n1 * n2
    N = min(N, total)

    heap = [(-(a[0] * b[0]), 0, 0)]
    visited = {(0, 0)}
    result = []

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

        if i + 1 < n1 and (i + 1, j) not in visited:
            visited.add((i + 1, j))
            heapq.heappush(heap, (-(a[i + 1] * b[j]), i + 1, j))

        if j + 1 < n2 and (i, j + 1) not in visited:
            visited.add((i, j + 1))
            heapq.heappush(heap, (-(a[i] * b[j + 1]), i, j + 1))

    return result