Reduce $K$ to the set of pairs of natural numbers codifying programs such that the domains of the functions implemented by them share at least two elements (roughly, the set of pairs of programs implementing functions whose domains share at least two elements), in order to prove that such set is undecidable (not recursive).