Label the non-winning tickets $1$, $2$, and so on up to $N-3$. let $X_i=1$ non-winning ticket $i$ is drawn before any winning ticket is drawn. Let $X_i=0$ otherwise.
Let
$$X=X_1+X_2+\cdots+X_{N-3}.$$
The sum of the $X_i$ is the number of tickets drawn before a winner is drawn. We really mean before. So if you want to include the draw in which the first winning ticket is obtained, the random variable you are interested in is $X+1$. But of course if we find $E(X)$, we just add $1$ to find $E(X+1)$.
The $X_i$ are not independent. However, expectation always has the following linearity property:
$$E(X)=E(X_1+X_2+\cdots +X_n)=E(X_1)+E(X_2)+\cdots +E(X_n).$$
Now we find $\Pr(X_i=1)=E(X_i)$. This is the probability that non-winning ticket $i$ is drawn before any winner. All orders of the tickets are equally likely. The probability ticket $i$ comes before any winner is therefore $\dfrac{1}{4}$
Now we are finished! We have
$$E(X)=\frac{N-3}{4}.$$
If you want to count also the draw on which we got the first winner, add $1$.
A nearly identical argument will take care of $E(Y)$. We can define random variable $Y_i$ to be $1$ if all the winners are before non-winner $i$, and $0$ otherwise. Or more simply, film the drawing and play the movie in reverse!
I have not thought about the variance problem.
Added The variance is not too bad. Note that $E(X-Y)=0$, so we want $E((X-Y)^2)$. Express $X$ and $Y$ in terms of the $X_i$ and $Y_i$, and expand. We have $X_i^2=X_i$ and $Y_i^2=Y_i$. But there is a mess of cross terms to deal with. We will need the probability that $X_i=1$ and $X_j=1$ ($i\ne j$), and also the probability that $X_i=1$ and $Y_j=1$ (all pairs $(i,j)$). These are all accessible.