n,m = map(int,input().split())
v = list(map(int,input().split()))
r = list(map(int,input().split()))
a,b = map(int,input().split())
dpv = [0]*(sum(v)+1)
dpr = [0]*(sum(r)+1)
dpv[0] = 1
dpr[0] = 1
mod = 10**9+7
for i in range(n):
    for j in range(sum(v),-1,-1):
        if j+ v[i] <=sum(v):
            dpv[j+v[i]] += dpv[j]
            dpv[j+v[i]] %= mod
for i in range(m):
    for j in range(sum(r),-1,-1):
        if j+r[i] <= sum(r):
            dpr[j+r[i]]+= dpr[j]
            dpr[j+r[i]] %= mod
smv = [0]*(sum(v)+2)
for i in range(sum(v)+1):
    smv[i+1] = smv[i] + dpv[i]
ans = 0
for i in range(1,sum(r)+1):
    if dpr[i] == 0:continue
    vmin = a*i
    vmax = b*i
    
    ans += (smv[min(sum(v)+1,vmax+1)] - smv[min(sum(v)+1,vmin)])*dpr[i]
    ans %= mod
print(ans)