Distance Coloring

You have $N$ stones in a row, numbered from $1$ to $N$. You also have $K$ different colors with you. We know that the number of different ways of coloring these $N$ stones with these $K$ colors is $K^N$. But you now add an extra condition: - If $|j - i| < K$, then Stone $i$ and Stone $j$ cannot have the same color. In other words, you cannot color two stones with the same color if they are $\lt