Positive integers $n$, $k>1$ are given. Pasha and Vova play a game on a board $n\times k$. Pasha begins, and further they alternate the following moves. On each move a player should place a border of length 1 between two adjacent cells. The player loses if after his move there is no way from the bottom left cell to the top right without crossing any order. Determine who of the players has a winning strategy.