#include<bits/stdc++.h>
using namespace std;
const int maxn = 22, maxb = (1 << maxn);
int a[maxn], b[maxn], dp[maxb], left_val[maxb];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < m; i++)
cin >> b[i];
bool ch = 0;
for(int mask = 1; mask < (1 << m); mask++)
{
dp[mask] = -1;
for(int i = 0; i < m; i++)
{
if((mask >> i) & 1)
{
int mask2 = mask ^ (1 << i);
int tmp = dp[mask2];
if(left_val[mask2] + b[i] > a[tmp])
continue;
tmp += (left_val[mask2] + b[i] == a[tmp]);
if(tmp > dp[mask])
{
dp[mask] = tmp;
left_val[mask] = (left_val[mask2] + b[i] == a[tmp]) ? 0 : left_val[mask2] + b[i];
}
}
}
if(dp[mask] == n)
ch = true;
}
if(ch)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
