import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}

	// ======================================================================
	final int MAX = 100000;
	final int MOD = (int)(1e9) + 7;
	long[][] dpR = new long[2][MAX + 1010];
	long[][] dpV = new long[2][MAX + 1010];
	
	int calc(int n, int[] v, long[][] dp) {
		int now, next = 0;
		dp[0][0] = 1;
		for (int i = 0; i < n; i++) {
			now = i % 2;
			next = now ^ 1;
			Arrays.fill(dp[next], 0);
//			dpR[next] = new int[MAX + 1];
			for (int j = 0; j < MAX; j++) {
				dp[next][j + v[i]] = (dp[next][j + v[i]] + dp[now][j]) % MOD;
				dp[next][j] = (dp[next][j] + dp[now][j]) % MOD;
			}
		}
		dp[next][0] = 0;
		return next;
	}
	
	public void solve() {
		int N = ni();
		int M = ni();
		int[] V = ni(N);
		int[] R = ni(M);
		int A = ni();
		int B = ni();
		// 「電圧を選んで作成する集計値」の数を計算する
		int lastV = calc(N, V, dpV);
		for (int i = 0; i < MAX; i++) {
			dpV[lastV][i+1] = (dpV[lastV][i+1] + dpV[lastV][i]) % MOD;
		}
		// 「抵抗を選んで作成する集計値」の数を計算する
		int lastR = calc(M, R, dpR);

		long ans = 0; 
		int l, r;
		// 抵抗の取りうる範囲を繰り返す
		for (int i = 1; i < MAX; i++) {
			l = A * i;			// 最小電流　Ａ　＊　抵抗値　＝　最小電圧
			r = B * i;			// 最大電流　Ｂ　＊　抵抗値　＝　最大電圧
			if(l >= MAX)	continue;
			l = Math.max(l, 1);
			r = Math.min(r, MAX-1);
			ans += (((dpV[lastV][r] - dpV[lastV][l-1] + MOD) % MOD) * dpR[lastR][i]) % MOD;
			ans %= MOD;
//			out.println("(dpV[" + r + "] = " + dpV[lastV][r] 
//						+ "  - dpV[" + (l-1) + "] = " + dpV[lastV][l-1]
//						+ "  ) * dpR[" + i + "] = " + dpR[lastR][i]
//						+ " = " + ((dpV[lastV][r] - dpV[lastV][l-1]) * dpR[lastR][i])
//						+ "  --> ans = " + ans);
		}
		out.println(ans);
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);

	// Scanner
	private FastScanner scan = new FastScanner();

	int ni() {
		return scan.nextInt();
	}

	int[] ni(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	int[][] ni(int y, int x) {
		int[][] a = new int[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ni();
			}
		}
		return a;
	}

	long nl() {
		return scan.nextLong();
	}

	long[] nl(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = nl();
		}
		return a;
	}

	long[][] nl(int y, int x) {
		long[][] a = new long[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = nl();
			}
		}
		return a;
	}

	String ns() {
		return scan.next();
	}

	String[] ns(int n) {
		String[] a = new String[n];
		for (int i = 0; i < n; i++) {
			a[i] = ns();
		}
		return a;
	}

	String[][] ns(int y, int x) {
		String[][] a = new String[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ns();
			}
		}
		return a;
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}