The subset sum problem is NP Complete. I was wondering if the following variation can be proved to be NP Complete :
The cardinality of set of integers is $m$. And each element of the set is between $1$ and $m^2$. Repetitions are allowed. The objective is to find a subset that would sum up to a given sum.
This seems to be as hard as the subset sum itself, but i cant come up with a reduction that would prove my conjecture.