- 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 integer a1, a2, …, an - 1. For every integer, i were 1 ≤ i ≤ n - 1 the condition 1 ≤ ai ≤ n - i holds. Next, he made n - 1 portals, numbered by integers from 1 to n - 1. The i-th (1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai), and one can travel from cell i to cell (i + ai) using the i-th portal. Unfortunately, one cannot use the portal backward, which means one cannot move from the cell (i + ai) to cell i using the i-th portal. It is easy to see that because of condition 1 ≤ ai ≤ n - i one can’t leave the Line World using portals.
- 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 t by only using the constructed transportation system.

**Input**

- The first line contains two space-separated integers n (3 ≤ n ≤ 3 × 104) and t (2 ≤ t ≤ n) — the number of cells, and the index of the cell to which I want to go to.
- The second line contains n - 1 space-separated integer a1, a2, …, an - 1 (1 ≤ ai ≤ 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”.

**Sample Input 1:**

8 4 1 2 1 2 1 2 1

**Sample Output 1:**

YES

**Sample Input 2:**

8 5 1 2 1 2 1 1 1

**Sample Output 2:**

NO

**Note**:

- In the first sample, the visited cells are 1, 2, and 4; so we can successfully visit cell 4.
- In the second sample, the possible cells to visit are 1, 2, 4, 6, 7, and 8; so we can’t visit cell 5, which we want to visit.

**Code:**

```
#include <iostream>
#include <vector>
using namespace std;
void dfs(vector<int>*edges, int n, int start, bool*visited)
{
visited[start]=true;
for(int i=0; i<edges[start].size(); i++)
{
int adjacent=edges[start][i];
if(!visited[adjacent])
{
dfs(edges, n, adjacent, visited);
}
}
}
bool checker(vector<int> *edges, int n, int t)
{
bool *visited=new bool[n];
for(int i=0; i<n; i++)
{
visited[i]=false;
}
dfs(edges, n, 0, visited);
if(visited[t-1])
{
return true;
}
return false;
}
int main()
{
int n, t;
cin >> n >> t;
vector<int> *edges = new vector<int>[n];
for (int i = 1; i <= n - 1; i++)
{
int a;
cin >> a;
edges[i - 1].push_back(i + a - 1); // i-th (1 ≤ i ≤ n - 1) portal connects cell i and cell (i + ai)
}
if (checker(edges, n, t))
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
```

Code language: C++ (cpp)