#include<cstdio>

 using namespace std;

 int n,vis[][],w[],limit,sta;

 void dfs(int cur,int now)

 {

     if(cur>n) return;

     vis[cur][now]=;

     if(now+w[cur+]<=limit) if(!vis[cur+][now+w[cur+]]) dfs(cur+,now+w[cur+]);

     if(now-w[cur+]>=) if(!vis[cur+][now-w[cur+]]) dfs(cur+,now-w[cur+]);

 }

 int main()

 {

     scanf("%d%d%d",&n,&sta,&limit);

     for(int i=;i<=n;i++) scanf("%d",&w[i]);

     dfs(,sta);

     for(int i=limit;i>=;--i) if(vis[n][i])

       {

           printf("%d\n",i);

           return ;

       }

     puts("-1");

     return ;

 }