Submission #7479917

---

Source Code Expand

mod=10**9+7
def cmb(n,r):
    if n<0 or r<0 or r>n:
        return 0
    g1=[1,1]
    g2=[1,1]
    inverse=[0,1]
    for i in range(2,n+1):
        g1.append((g1[-1]*i)%mod)
        inverse.append((-inverse[mod % i]*(mod//i))%mod)
        g2.append((g2[-1]*inverse[-1])%mod)
    return g1[n]*g2[r]*g2[n-r]%mod

r,c=map(int,input().split())
x,y=map(int,input().split())
d,l=map(int,input().split())
if x==y==1:
    print(r*c)
    exit()
print((r-x+1)*(c-y+1)*cmb(d+l,d)*(
cmb(x*y,d+l)
-2*cmb(x*(y-1),d+l)-2*cmb((x-1)*y,d+l)
+4*cmb((x-1)*(y-1),d+l)+cmb(x*(y-2),d+l)+cmb((x-2)*y,d+l)
-2*cmb((x-2)*(y-1),d+l)-2*cmb((x-1)*(y-2),d+l)
+cmb((x-2)*(y-2),d+l)
)%mod)

Submission Info

Judge Result