Two players play a subtraction game with a single pile of n stones. On each turn, a player must remove either 1, 2, or k stones from the pile (where k is a given constant). The player who takes the last stone wins.

Both players play optimally. Given n and k, determine whether the first player can force a win.