import sys from itertools import accumulate def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 19 MOD = 10 ** 9 + 7 EPS = 10 ** -10 N, M = MAP() V = LIST() R = LIST() L, H = MAP() MX = 100000 dp1 = list2d(2, MX+1, 0) dp1[0][0] = 1 for i, v in enumerate(V): for j in range(MX+1): if dp1[i&1][j]: dp1[(i+1)&1][j] += dp1[i&1][j] dp1[(i+1)&1][j+v] += dp1[i&1][j] dp1[(i+1)&1][j] %= MOD dp1[(i+1)&1][j+v] %= MOD dp1[i&1][j] = 0 dp2 = list2d(2, MX+1, 0) dp2[0][0] = 1 for i, r in enumerate(R): for j in range(MX+1): if dp2[i&1][j]: dp2[(i+1)&1][j] += dp2[i&1][j] dp2[(i+1)&1][j+r] += dp2[i&1][j] dp2[(i+1)&1][j] %= MOD dp2[(i+1)&1][j+r] %= MOD dp2[i&1][j] = 0 acc = list(accumulate(dp2[M&1])) ans = 0 for v, cnt in enumerate(dp1[N&1]): if v == 0: continue hir = v // L lowr = ceil(v, H) ans += cnt * (acc[hir] - acc[lowr-1]) ans %= MOD print(ans)