#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = write!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! eprintln {
	() => { eprintln!(""); };
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = writeln!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! dbg {
	($v:expr) => {{
		let val = $v;
		eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
		val
	}}
}

macro_rules! mat {
	($($e:expr),*) => { Vec::from(vec![$($e),*]) };
	($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
	($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
	($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
	($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
		$a$([$i])*.$f($($t),*)
	};
	($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
		let t = $e;
		ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
	} };
}

pub fn readln() -> String {
	let mut line = String::new();
	::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
	line
}

macro_rules! read {
	($($t:tt),*; $n:expr) => {{
		let stdin = ::std::io::stdin();
		let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
			let line = line.unwrap();
			let mut it = line.split_whitespace();
			_read!(it; $($t),*)
		}).collect::<Vec<_>>();
		ret
	}};
	($($t:tt),*) => {{
		let line = readln();
		let mut it = line.split_whitespace();
		_read!(it; $($t),*)
	}};
}

macro_rules! _read {
	($it:ident; [char]) => {
		_read!($it; String).chars().collect::<Vec<_>>()
	};
	($it:ident; [u8]) => {
		Vec::from(_read!($it; String).into_bytes())
	};
	($it:ident; usize1) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
	};
	($it:ident; [usize1]) => {
		$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
	};
	($it:ident; [$t:ty]) => {
		$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
	};
	($it:ident; $t:ty) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
	};
	($it:ident; $($t:tt),+) => {
		($(_read!($it; $t)),*)
	};
}

pub fn main() {
	let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 1_000_000_007;
const INF: f64 = std::f64::MAX/2.0;

fn solve() {
	let (n,m) = read!(usize,usize);
	let v = read!([usize]);
	let r = read!([usize]);
	let (a,b) = read!(i64,i64);
	let mut dpv = vec![vec![0;200010];v.len()+1];
	let mut dpr = vec![vec![0;200010];r.len()+1];
	dpv[0][0] = 1;
	dpr[0][0] = 1;
	for i in 0..v.len() {
		for j in 0..100010 {
			if dpv[i][j]==0 {
				continue;
			}
			let nv = j + v[i];
			dpv[i+1][nv] += dpv[i][j];
			dpv[i+1][nv] %= MOD;
			dpv[i+1][j] += dpv[i][j];
			dpv[i+1][j] %= MOD;
		}
	}
	for i in 0..r.len() {
		for j in 0..100010 {
			if dpr[i][j]==0 {
				continue;
			}
			let nr = j + r[i];
			dpr[i+1][nr] += dpr[i][j];
			dpr[i+1][nr] %= MOD;
			dpr[i+1][j] += dpr[i][j];
			dpr[i+1][j] %= MOD;
		}
	}
	let mut vlist = vec![0;200010];
	for i in 0..100010{
		vlist[i+1] = vlist[i] + dpv[v.len()][i];
		vlist[i+1] %= MOD;
	}
	let mut ans = 0;
	for i in 1..100005 {
		let left = min(100001, a*(i as i64)) as usize;
		let right = min(100002, b*(i as i64)) as usize;
		let mut sum = vlist[right+1] as i64 - vlist[left] as i64;
		sum = (sum%(MOD as i64)+MOD as i64)%MOD as i64;
		ans += (sum as i64 * dpr[r.len()][i] as i64) % MOD as i64;
		ans %= MOD as i64;
	}
	println!("{}", ans);
}

fn run() {
    solve();
}