n, m = map(int, input().split())
v = list(map(int, input().split()))
r = list(map(int, input().split()))
a, b = map(int, input().split())
mod = 1000000007

s = sum(v)
d = [0] * (s + 1)
for e in v:
    for k in reversed(range(1, s + 1)):
        if d[k] > 0:
            d[k + e] += d[k]
    d[e] += 1

u = sum(r)
t = [0] * (u + 1)
for e in r:
    for k in reversed(range(1, u + 1)):
        if t[k] > 0:
            t[k + e] += t[k]
    t[e] += 1

res = [0] * (s + 1)
for k in range(1, s + 1):
    res[k] = res[k - 1] + d[k]

ans = 0
for k in range(1, u + 1):
    ans += t[k] * (res[min(s, k * b)] - res[min(s, k * a - 1)])
print(ans % mod)