People arrive at rate $\lambda$.
There are $s$ servers, with service time distributed with rate $\mu$.
At $t=0$ all servers are busy, nobody is in the waiting line.
Question: What is the probability that exactly $k$ people arrive before one of the servers finishes service?
I know that $P(X=k)=e^\lambda \lambda^k/k!$ Since there are $s$ servers, the first one will finish at $\min [s_1,s_2,...,s_s]$ which happens at rate $s\mu$, so waiting time is $1/s\mu$.
However I can't figure out how to compute them together.