Good puzzles, though the ones with reuseable operands are much easier. For any two numbers X and Y that are relatively prime, a solution exists for value Z where mX - nY = Z (If you have a reusable adder and a reusable subtracter, and they don't divide by the same number, you can get literally any other number. It might take you a while, but you can do it.)