import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

# I=V/R
# A<=V/R<=B
# A*R<=V<=B*R

def DP(vv):
    dp = [0]*(mx+1)
    dp[0] = 1
    for v in vv:
        for i in range(mx-v, -1, -1):
            dp[i+v] = (dp[i+v]+dp[i])%md
    return dp

mx = 100000

n, m = LI()
vv = LI()
rr = LI()
a, b = LI()

vdp = DP(vv)
rdp = DP(rr)
cs = [0]
for c in vdp: cs.append(cs[-1]+c)

ans = 0
for r, c in enumerate(rdp[1:], 1):
    left = a*r
    if left > mx: break
    if c == 0: continue
    right = min(mx, b*r)+1
    ans += (cs[right]-cs[left])*c
    ans %= md

print(ans)