How to show that this problem is NP-hard: Find two subsets of 2 given sets such that the difference between the subset sums is $\leq v$
The special case where $v=0$  and $Y=\{\frac12\sum_{i=1}^m x_i\}$ is the partition problem, which is NP-complete.