/* * Author: fuad720 * Time: 2022-12-27 23:33 * Lang: C++ */ #ifndef LOCAL #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #endif #include <bits/stdc++.h> using namespace std; using ll = long long; #define FOR(i,a,b) for(int i=int(a);i<int(b);i++) #define rep(i,b) FOR(i,0,b) #define FORN(i,a,b) for(int i=int(b)-1;i>=a;i--) #define per(i,b) FORN(i,0,b) #define mkp make_pair #define pb push_back #define ep emplace_back #define ff first #define ss second #define bg begin() #define ed end() #define sz(x) (int)x.size() #define all(x) (x).bg,(x).ed #define FIO ios_base::sync_with_stdio(0);\ cin.tie(0); template<class t> using vc=vector<t>;; template<class t> using vvc=vc<vc<t>>; using pii=pair<int,int>; using pll=pair<ll,ll>; using vi= vc<int>; using vll= vc<ll>; #ifdef LOCAL #include "/home/fuad/cp/dbg.h" #else #define dbg(x...) #endif mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count()); void solve() { ll n, m; cin >> n >> m; ll a[n],b[m]; rep(i,n)cin >> a[i]; rep(i,m)cin >> b[i]; vector<ll> bt[n]; rep(i,(1<<m)) { ll sum=0; rep(j,m) { if((1<<j)&i) sum+=b[j]; } rep(j,n) { if(sum==a[j]){ bt[j].pb(i); } } } bool dp[n+1][(1<<m)]; memset(dp,0,sizeof dp); rep(i,(1<<m))dp[0][i]=1; FOR(i,1,n+1) { rep(j,(1<<m)) { for(int k:bt[i-1]) { if((k&j)==k)dp[i][j]|=dp[i-1][j^k]; } } } cout << (dp[n][(1<<m)-1]?"YES":"NO") << "\n"; } int main () { FIO; int t=1; while(t--) solve(); }