import java.util.*;
import java.lang.*;
import java.io.*;
class Main {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
st= new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int S = Integer.parseInt(st.nextToken());
long L = Long.parseLong(st.nextToken());
int[] dist = new int[N];
st= new StringTokenizer(br.readLine());
for (int i=1; i<N; i++) {
dist[i] = Integer.parseInt(st.nextToken());
}
int[] acc_dist = new int[N+1];
for (int i=1; i<=N; i++) {
if(S-i>=1) {
acc_dist[S-i] = acc_dist[S-i+1] + dist[S-i];
}
if(S+i<=N) {
acc_dist[S+i] = acc_dist[S-1+i] + dist[S-1+i];
}
}
int max_visite = 0;
for (int l=1; l<=N; l++) {
for (int r = l; r <= N; r++) {
int dist1 = acc_dist[S] - acc_dist[l];
int dist2 = acc_dist[r] - acc_dist[S];
int d = Math.min(dist1 + dist2*2, dist1*2+dist2);
if(L>=d) {
max_visite = Math.max(max_visite , r-l+1);
}
}
}
System.out.println(max_visite);
}
}
To embed this project on your website, copy the following code and paste it into your website's HTML: