#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <list>
#include <deque>
#include <queue>
#include <functional>
#include <bitset>
#include <set>
using namespace std;int e[55];int main()
{int n,m,k,i;cin >> n >> m >> k;for(i = 0; i < n; i++)cin >> e[i];sort(e, e+n);int ok = 0;int ans = 0;int cur = k;if(cur >= m)    ok = 1;for(i = n-1; i >= 0 && !ok; i--){cur = cur-1 + e[i];ans++;if(cur >= m){ok = 1;break;}}   if(ok)  cout << ans << endl;else    cout << "-1" << endl;return 0;
}

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <vector>
#include <map>
#include <list>
#include <deque>
#include <queue>
#include <functional>
#include <bitset>
#include <set>
using namespace std;vector<double> e;int main()
{int n,i;double x,y;cin >> n;for(i = 0; i < n; i++){scanf("%lf %lf", &x,&y);double tmp = atan2(y,x);if(tmp < 0)e.push_back(2*M_PI+tmp);elsee.push_back(tmp);}sort(e.begin(), e.end());double dif = 0.0;for(i = 1; i < e.size(); i++)dif = max(dif, e[i]-e[i-1]);dif = max(dif, 2*M_PI - (e[n-1]-e[0]));printf("%.10lf\n", 360.0 - dif*180.0/M_PI);return 0;
}

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <functional>
#include <iterator>
#include <typeinfo>
#include <utility>
#include <memory>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstddef>
#include <complex>
#include <ctime>
#include <cassert>
using namespace std;
static inline bool get(int &v)
{int s = 1, c;while(!isdigit(c = getchar())&&c != '-'){if(c == EOF)break ;}if(c == EOF) return 0;if(c == '-') s = 0 , v = 0;else v = c^48;for(;isdigit(c = getchar());v = (v << 1) + (v << 3) + (c ^ 48));v = (s ? v : -v);return 1 ;
}vector<int> e;
char ans[100005];
int main()
{int n,i,tmp;get(n);for(i = 0;i < n; i++){get(tmp); e.push_back(tmp);}int mend = 0;for(i = n-1; i >= 0; i--){if(mend > 0)    {mend -= e[i];ans[i] = '-';}else    {mend += e[i];ans[i] = '+';}}if(mend < 0){for(i = 0; i < n; i++){if(ans[i] == '+')    printf("-");else    printf("+");}}else{for(i = 0; i < n; i++){printf("%c", ans[i]);}}printf("\n");return 0;
}