Given two sets $A$ and $B$, members of $A$ have been split into subsets Si which maybe they have intersections with each other and union of them maybe not equal to A  determine whether there is a mapping of members of $A$ to $B$ so that each member of $B$ has been mapped by at most $k$ members of $A$ that are in one subset Si.