#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int memoi[N][(1<<20)];
int arr1[N], arr2[N];
int n, m;
bool isPos(int i, int v, int d){
if (memoi[i][d] != 0){
return memoi[i][d]-1;
}
if (v == 0){
if (i == n-1){
return 1;
}
i ++;
v = arr1[i];
return isPos(i, v, d);
}
bool pos = 0;
for (int x = 0; x < m; x ++){
if (d&(1<<x)){
if (arr2[x] <= v){
pos |= isPos(i, v-arr2[x], d&(~(1<<x)));
}else {
break;
}
}
}
if (v == arr1[i]){
memoi[i][d] = pos+1;
}
return pos;
}
int main() {
cin >> n >> m;
for (int x = 0; x < n; x ++){
cin >> arr1[x];
}
for (int x = 0; x < m; x ++){
cin >> arr2[x];
}
sort(arr1, arr1+n);
sort(arr2, arr2+m);
bool pos = isPos(0, arr1[0], (1<<m)-1);
cout << (pos ? "YES" : "NO") << endl;
return 0;
}
