#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
vector<int> b(m);
for (auto &i : b) cin >> i;
vector<vector<bool>> dp(n + 1, vector<bool>(1<<m));
for (int j = 0; j < 1<<m; j++) dp[0][j] = true;
for (int j = 0; j < 1<<m; j++) {
int sm = 0, x = j;
while (x) {
sm += b[x & -x];
x -= x & -x;
}
int p = 0;
for (int i = 1; i <= n; i++) {
p += a[i];
if (sm == p) dp[i][j] = dp[i - 1][j];
int x = j;
while (x && !dp[i][j]) {
dp[i][j] = dp[i][j - (x & -x)];
x -= x & -x;
}
}
}
cout << (count(dp[n].begin(), dp[n].end(), true) ? "YES" : "NO");
}
