np complete – Set partition with an allowable difference


I have a variation of the partition problem, which is to partition the multiset S into two subsets S1, S2 such that the difference between the sum of elements in S1 and the sum of elements in S2 is smaller than K. I wonder if this is also a NP hard problem?