/*
#ifndef ONLINE_JUDGE
#include "AkbarKING.h"
#else
#define debug(...)
#define debugArr(...)
#define debugG(...)
#endif
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using __indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using __indexed_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
const int sz = 3e5+9;
const int LOG = 21;
const int MOD = 1e9+7;
const int INF = 1e18;
int a[sz], b[sz];
int n, m;
vector<vector<int>>BIT[LOG];
bool memo[LOG][1LL << LOG];
bool vis[LOG][1LL << LOG];
bool backtrack(int i, vector<vector<int>> ¤t, int used_mask)
{
if (i == n)
{
vis[i][used_mask] = 1;
return memo[i][used_mask] = 1;
}
if (vis[i][used_mask])
{
return memo[i][used_mask];
}
vis[i][used_mask] = 1;
for (const auto &subset : BIT[i])
{
int subset_mask = 0;
for (auto x : subset)
{
subset_mask |= (1LL << x);
}
if (used_mask & subset_mask)
{
continue;
}
current.ep(subset);
if (backtrack(i + 1, current, used_mask | subset_mask))
{
vis[i][used_mask] = 1;
return memo[i][used_mask] = 1;
}
current.pop_back();
}
vis[i][used_mask] = 1;
return memo[i][used_mask] = 0;
}
void solve()
{
cin >> n >> m;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
for (int i = 0; i < m; ++i)
{
cin >> b[i];
}
for (int i = 0; i < n; ++i)
{
for (int mask = 1; mask < (1LL << m); ++mask)
{
vector<int> ind;
int sum = 0;
for (int j = 0; j < m && sum <= a[i]; ++j)
{
if (mask & (1LL << j))
{
ind.ep(j);
sum += b[j];
}
}
if (sum == a[i])
{
BIT[i].ep(ind);
}
}
}
vector<vector<int>> current;
cout << (backtrack(0, current, 0) ? "YES" : "NO") << '\n';
}
signed main()
{
$AzH_TxdmN$
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
}
