cpp
#include<bits/stdc++.h>
using namespace std;
const int N=210;
int n,x,y,a[N];
//这道题的方向数组是不定的 
int vis[N],dis[N];
int dfs(int x)
{
//	vis[x]=1;
	if(x == y)  return dis[x];
    int dir[2]={a[x],-a[x]};
    cout<<dir[0]<<" "<<dir[1]<<endl;
	for(int i=0;i<=1;i++)
	{
		int xx=dir[i]+x;
		cout<<"所有的xx="<<xx<<endl;
		if(xx>=0 && xx<=n)// && vis[x]==0) 
		{
		    cout<<"能走到的xx="<<xx<<endl;			
			dfs(xx);
			dis[x]=dis[xx]+1;
		}
	}
}

int main()
{
	cin>>n>>x>>y;
	for(int i=1;i<=n;i++)
	    cin>>a[i];
	if(dfs(x) ==0)  cout<<"-1"<<endl;
	else cout<<dfs(x)<<endl;
	return 0; 	
}