#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
const int N = 22;
bool dp[N+1][1<<N];
int a[N], b[N];
int sum[1<<N];
int n, m;
int main()
{
cin.tie(0) -> sync_with_stdio(false);
cin >> n >> m;
Loop (i,0,n)
cin >> a[i];
Loop (i,0,m)
cin >> b[i];
memset(dp[0], 1, sizeof(dp[0]));
Loop (i,1,1<<m)
sum[i] = sum[i ^ (i & -i)] + b[__builtin_ctz(i)];
Loop (i,0,n) {
Loop (j,0,1<<m) {
if (sum[j] == a[i])
dp[i+1][j] = dp[i][((1<<m)-1) ^ j];
}
Loop (j,0,m) {
Loop (k,0,1<<m) {
if (k & (1<<j))
dp[i+1][k] |= dp[i+1][k ^ (1<<j)];
}
}
}
cout << (dp[n][(1<<m)-1]? "YES": "NO") << '\n';
}
