/**************************************************************
Problem: 2748
User: LittlePointer
Language: C++
Result: Accepted
Time:4 ms
Memory:1576 kb
****************************************************************/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <stack>
#include <map>
using namespace std;
#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));
typedef long long LL;
template<class T> void read(T&num) {
char CH; bool F=false;
for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar());
for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar());
F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
if(!p) { puts("0"); return; }
while(p) stk[++ tp] = p%10, p/=10;
while(tp) putchar(stk[tp--] + ‘0‘);
putchar(‘\n‘);
}
const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9;
const int N=1e5+20;
const int maxn=1e3+220;
const double eps=1e-12;
int a[100],dp[60][maxn];
int main()
{
int beg,mmax,n;
read(n);read(beg);read(mmax);
dp[0][beg]=1;
For(i,1,n)
{
read(a[i]);
for(int j=0;j<=mmax;j++)
{
if(dp[i-1][j])
{
if(j+a[i]<=mmax)dp[i][j+a[i]]=1;
if(j-a[i]>=0)dp[i][j-a[i]]=1;
}
}
}
int ans=-1;
for(int i=mmax;i>=0;i--)if(dp[n][i])ans=max(ans,i);
cout<<ans<<"\n";
return 0;
}