#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>

#define fr first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define forn(i, n) for (int i = 0; i < n; ++i)
#define forln(i, l, n) for (int i = l; i < n; ++i)

#define LOCAL

using namespace std;

#ifdef LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n';
#else
	#define dbg(x)
#endif

//tg: @galebickosikasa

const int maxn = (int) 3e5;
const ll inf = (ll) 2e9;
const ld pi = 3.14159265358979323846264;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

random_device rd;
mt19937 SuperRandom(rd());



int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n, m;
	cin >> n >> m;
	vector<int> goo (m);
	cinv (goo);
	sort (all (goo));
	int k;
	cin >> k;
	vector<int> w (k);
	cinv (w);
	bitset<1000000 + 10> a;
	a[0] = 1;
	for (auto& x: w) {
		forn (i, n / x) a |= (a<<x);
	}
	int ans = m;
	for (auto& x: goo) if (a[x]) --ans;
	if (ans == 0) cout << "YES";
	else cout << ans;





}