Dan and Sam play a game on a $5\times3$ board. Dan places a White Knight on a corner and Sam places a Black Knight on the nearest corner. Each one moves his Knight in his turn to squares that have **not** been already visited by any of the Knights at any moment of the match.

For example, Dan moves, then Sam, and Dan wants to go to Black Knight's initial square, but he can't, because this square has been occupied earlier.

When someone can't move, he loses. If Dan begins, who will win, assuming both players play optimally?