Problem description

New Year is coming in Line World! In this world, there are n cells numbered by integers from 1 to n, as a 1?×?n board. People live in cells. However, it was hard to move between distinct cells, because of the difficulty of escaping the cell. People wanted to meet people who live in other cells.

So, user tncks0121 has made a transportation system to move between these cells, to celebrate the New Year. First, he thought of n?-?1 positive integers a₁,?a₂,?...,?a_n?-?1. For every integer i where 1?≤?i?≤?n?-?1 the condition 1?≤?a_i?≤?n?-?i holds. Next, he made n?-?1 portals, numbered by integers from 1 to n

Currently, I am standing at cell 1, and I want to go to cell t. However, I don‘t know whether it is possible to go there. Please determine whether I can go to cell tby only using the construted transportation system.

Input

The first line contains two space-separated integers n (3?≤?n?≤?3?×?10⁴) and t (2?≤?t?≤?n) — the number of cells, and the index of the cell which I want to go to.

The second line contains n?-?1 space-separated integers a₁,?a₂,?...,?a_n?-?1 (1?≤?a_i?≤?n?-?i). It is guaranteed, that using the given transportation system, one cannot leave the Line World.

Output

If I can go to cell t using the transportation system, print "YES". Otherwise, print "NO".

Examples

8 4
1 2 1 2 1 2 1

YES

8 5
1 2 1 2 1 1 1

NO

Note

In the first sample, the visited cells are: 1,?2,?4; so we can successfully visit the cell 4.

In the second sample, the possible cells to visit are: 1,?2,?4,?6,?7,?8; so we can‘t visit the cell 5, which we want to visit.

解題思路：從cell1即f[1]出發，只要當前f[i]能到達，f[i+a[i]]就能到達，最後查看f[t]是否為true（表示已經訪問過），是的話為"YES"，否則為"NO"。

AC代碼：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int maxn=3e4+5;
 4 int n,t,a[maxn];bool f[maxn];
 5 int main(){
 6     cin>>n>>t;
 7     memset(f,false,sizeof(f));f[1]=true;
 8     for(int i=1;i<n;++i)cin>>a[i];
 9     for(int i=1;i<n;++i)
10         if(f[i])f[i+a[i]]=true;
11     if(f[t])cout<<"YES"<<endl;
12     else cout<<"NO"<<endl;
13     return 0;
14 }

S - New Year Transportation