Two candidates, say A and B, are running for office. Candidate A received n votes, while Candidate B received m votes, with n>m. The n+m votes are thrown into a box and shuffled around. Then, the votes are drawn without replacement one-by-one. A running tally of the number of votes for each candidate is kept. The probability that Candidate A is never behind in the voting count (excluding the initial state where both have 0) is a function Q(n,m). Find Q(100,80).
