#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".inp").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
const int MX = 20;
int N, M, A[MX], B[MX];
pi dp[1<<20];
void solve() {
cin>>N>>M;
F0R(i,N) cin>>A[i];
F0R(i,M) cin>>B[i];
F0R(i,1<<M) dp[i] = {-1,-1};
dp[0] = {0,0};
F0R(msk,1<<M) {
F0R(lst, M) if((msk>>lst&1) && dp[msk^(1<<lst)].first != -1) {
pi pre = dp[msk^(1<<lst)];
if(pre.second + B[lst] > A[pre.first]) continue;
pre.second += B[lst];
if(pre.second == A[pre.first]) pre.first++, pre.second = 0;
dp[msk] = pre;
if(pre.first == N) {
cout << "YES\n";
return;
}
}
}
cout << "NO\n";
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
