Submission #4245445

---

Source Code Expand

#!usr/bin/env python3
from collections import defaultdict
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007

#A

#B

#C
"""
n,k = LI()
r = LI()
r.sort()
r = r[::-1][:k]
ans = 0
l = 2
for i in range(k):
    ans += r[i]/l
    l *= 2
print(ans)
"""

#D
def c(x,y):
    return fact[x]//(fact[y]*fact[x-y])

def calc(x,y,d,l):
    if x*y < d+l:
        return 0
    return c(x*y,d+l)*c(d+l,d)
r,co = LI()
x,y = LI()
d,l = LI()
fact = [1]
for i in range(x*y):
    fact.append(fact[-1]*(i+1))

m = (r-x+1)*(co-y+1)
ans = calc(x,y,d,l)-2*calc(x-1,y,d,l)-2*calc(x,y-1,d,l)+4*calc(x-1,y-1,d,l)+calc(x-2,y,d,l)+calc(x,y-2,d,l)-2*calc(x-1,y-2,d,l)-2*calc(x-2,y-1,d,l)+calc(x-2,y-2,d,l)
ans %= mod
ans *= m
print(ans%mod)
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission Info

Judge Result