#include <bits/stdc++.h>
using namespace std;
#define pii pair <int, int>
#define fi first
#define se second
int n, m, a[25], b[25], sum = 0, cnt;
bool mp[20005];
signed main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
mp[sum] = true;
}
for (int i = 1; i <= m; i++)
cin >> b[i];
sort (b + 1, b + 1 + n);
do {
sum = 0, cnt = 0;
for (int i = 1; i <= m; i++) {
sum += a[i];
cnt += mp[sum];
}
if (cnt == n) {
cout << "YES";
return 0;
}
} while (next_permutation (b + 1, b + 1 + m));
cout << "NO";
}
