If we fix $z$, we have $x + 2y = N-Kz$. If $N-Kz > 1$, we can always choose the parity of $x+y$ by choosing between $y=0$ and $y=1$. If $N-Kz \le 1$ we are forced to have $x = N-Kz$, $y=0$.
Therefore the only cases which fail for the choice $z = \left\lfloor\frac NK\right\rfloor$ are (a) $z$ is odd, $N - Kz = 1$; (b) $z$ is even, $N - Kz = 0$.
If we can choose $z = \left\lfloor\frac NK\right\rfloor - 1$, similar constraints apply. Of course, we can't do that validly if that would give $z < 0$.
So the cases where this is impossible are:
- $\left\lfloor\frac NK\right\rfloor = 0$, $N - K\left\lfloor\frac NK\right\rfloor = 0$. That comes down to $N = 0$. I'm not sure whether you consider $0$ positive or not, but I presume not since you also use the term non-negative in the question.
- $\left\lfloor\frac NK\right\rfloor$ is odd, $N - K \left\lfloor\frac NK\right\rfloor = 1$, $N - K \left(\left\lfloor\frac NK\right\rfloor - 1\right) = 0$. But then $K = -1$, so this is not a valid solution.
- $\left\lfloor\frac NK\right\rfloor$ is even, $N - K \left\lfloor\frac NK\right\rfloor = 0$, $N - K \left(\left\lfloor\frac NK\right\rfloor - 1\right) = 1$. But then $K = 1$, so this is not a valid solution.
Conclusion: for all $N > 0$ and $K > 1$ it is possible.