#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>

#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mod 1000000007
using namespace std;
template<class T, class U>
T &chmax(T &a, const U &b){ if(a < b) a = b; return a; }
template<class T, class U>
T &chmin(T &a, const U &b){ if(a > b) a = b; return a; }
int main(){
  int n;
  cin >> n;
  vi a(n);
  rep(i, n){
    cin >> a[i];
    a[i] %= 200;
  }
  vector<vl> dp(n + 1, vl(200));
  vector<vvi> root(n + 1, vvi(200));

  vi ans1, ans2;
  dp[0][0] = 1;
  rep(i, n){
    rep(j, 200){
      if(dp[i + 1][j] <= dp[i][j] + dp[i][(j - a[i] + 200) % 200]){
        dp[i + 1][j] = dp[i][j] + dp[i][(j - a[i] + 200) % 200];
        if(dp[i][(j - a[i] + 200) % 200] >= 1){
          root[i + 1][j] = root[i][(j - a[i] + 200) % 200];
          root[i + 1][j].push_back(i);
        }else if(dp[i][j] >= 1){
          root[i + 1][j] = root[i][j];
        }
        if(dp[i][j] >= 1 && dp[i][(j - a[i] + 200) % 200] >= 1 && root[i][j].size() >= 1){
          ans1 = root[i][j];
          ans2 = root[i][(j - a[i] + 200) % 200];
          ans2.push_back(i);
          goto out;
        }
      }
    }
  }
  cout << "No\n";
  return 0;
  out:
  cout << "Yes\n";
  int l = ans1.size();
  int r = ans2.size();
  cout << l << " ";
  rep(i, l - 1) cout << ans1[i] + 1 << " ";
  cout << ans1[l - 1] + 1 << "\n";
  cout << r << " ";
  rep(i, r - 1) cout << ans2[i] + 1 << " ";
  cout << ans2[r - 1] + 1 << "\n";
}
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)

using namespace std;
typedef pair<int,int> P;
typedef long long ll;


int main()
{
    int n,k,m;
    cin >> n >> k >> m;

    ll sum = 0;
    rep(i,n-1){
        int t;
        cin >> t;
        sum += t;
    }

    int est = n*m - sum;

    if(est < 0){
        est = 0;
    }

    if(est <= k){
        cout << est << endl;
        return 0;
    }

    cout << -1 << endl;

    return 0;
}