#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int mod = 998244353;
const int N = (int)1e4 + 7;
#define endl '\n'
#define skip continue
#define uno first
#define duo second
#define YES cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define GO while(tt--)
#define ins insert
#define pb push_back
#define all(x) x.begin(), x.end()
#define forest signed
#define Kaldun cin.tie(0)->sync_with_stdio(0)
#define int long long
int bp(int a, int n) {
if(n == 0) return 1;
if(n % 2 == 1) return (bp(a, n-1) * 1LL * a) % mod;
long long b = bp(a, n/2);
return (b * b) % mod;
}
signed main() {
//freopen("time.in", "r", stdin);
//freopen("time.out", "w", stdout);
Kaldun;
int n,m;
cin>>n>>m;
int dp[1007]{};
dp[0] = 1;
int x;
cin>>x;
for(int i=1;i<=m;i++) {
int d;
cin>>d;
for(int j=x;j>=d;j--){
dp[j]=(dp[j]+dp[j-d])%mod;
}
}
if(dp[x] == 0) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
