#include <bits/stdc++.h> #define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout) #define all(x) (x).begin(), (x).end() #define pb push_back #define sz(x) (int)x.size() #define F first #define S second #define int long long const int dx[] = {0, 1, 0, -1, -1, 1, 1, -1}; const int dy[] = {1, 0, -1, 0, -1, 1, -1, 1}; const int maxn = 21; const int N = 2e5+7; const int inf = 1e18; const int mod = 1e9+7; using namespace std; int n, m; int a[maxn], b[maxn]; int dp[(1 << 21)+2][maxn]; vector<int> msk[N]; 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 mask = 1; mask < (1 << m); mask++){ int sum = 0; for(int i = 0; i < m; i++){ if((mask >> i) & 1){ sum += b[i]; } } if(sum == a[0]){ dp[mask][0] = 1; } msk[sum].pb(mask); } for(int mask = 1; mask < (1 << m); mask++){ for(int i = 1; i < n; i++){ for(auto x : msk[a[i]]){ if((mask | x) == mask){ dp[mask][i] &= dp[(mask ^ x)][i - 1]; } } } } for(int mask = 1; mask < (1 << m); mask++){ if(dp[mask][n - 1] != 0){ // cout << mask << ' ' << n - 1 << '\n'; cout << "YES\n"; return; } } cout << "NO"; } signed main(){ speed int test = 1; // cin >> test; while(test--){ solve(); } }