If i want to find three distinct int a,b,and c such that there are submitted to the constraint a+b+c=1000, is this a problem for the knapsack algo? I thought of doing this the bruteforce way, but that would be foolish 'cuz there are way too many combination of 3 numbers below 1000.