The OP problem is easier if you think of it as assigning bins to items, and not as assigning items to bins. Each item MUST have one and only one bin. If you switch your thinking to assign on value in set Y to each of the items in X, then it becomes a much more clear problem.

Each item in X can be assigned exactly one of the values in Y. It is now the same class of a problem as counting in binary.