3 3 1
 300 2 300
 4000 4000 1
 4000 4000 100
 4 2 3
 3 300 300
 4000 100 4000
 3 300 1
 300 300 1
 4000 1000 3000
 3 2 4000
 4 3 2
 3 2 300
 4000 3998 2
 100 200 300
 300 300 300
 3 3 3
 10 10 10
 10 4 9
 239 300 231
 4000 2 3998
 200 100 300
 4000 2000 2000
 4000 4000 4000
 10 7 5
 4000 100 3900
 3 4000 4000

12
 775907030
 63263244
 994443885
 24
 496527918
 908339579
 828107078
 775907030
 876839920
 938379934
 48
 196174631
 296557186
 316471646
 375912430
 72
 318389383
 135283173
 774612666
 686088712
 949581532
 310481606
 997463324
 130636800
 221262673
 680114446

C=lambda n,k:F[n]*R[k]*R[n-k]%B
def pow(x,y):return 1 if y==0 else (pow(x,y/2)**2)%B if y%2==0 else (pow(x,y-1)*x)%B
n,w,b=map(int,raw_input().split())
S,R,F,B,ans=[0]*4445,[1]+[0]*4444,[1]+[0]*4444,1000000009,0
for i in range(1,4444):F[i],R[i],S[i]=F[i-1]*i%B,pow(F[i-1]*i,B-2)%B,S[i-1]+w-i
print sum(C(b-1,i-1)*C(w-2,n-2-i)*S[n-i-1] for i in range(1,n))*F[w]*F[b]%B
