#define _GLIBCXX_DEBUG //遅い可能性がある 
#include <bits/stdc++.h>
#include<atcoder/all>
#include<boost/multiprecision/cpp_int.hpp> //多倍長
using namespace boost::multiprecision; // 多倍長.型はcpp_int
using namespace atcoder;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end() //lower_bound(ALL(a),x)
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;

int INF = 100100100;

const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};

int depth[110000];
int mxdepth[110000];

void dfs(VVI& G, int v, int p) {
    for (int u: G[v]) {
        if (u == p) continue;
        depth[u] = depth[v] + 1;
        mxdepth[u] = max(mxdepth[u], depth[u]);
        dfs(G,u,v);
        mxdepth[v] = max(mxdepth[v], mxdepth[u]);
    }
}

int main() {
    ll n,m,s;
    cin >> n >> m >> s;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    int total = 0;
    rep(i,n) total += a[i];
    if (abs(total - s)%m == 0) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
    return 0;
}