B - Jumping Monkey

There are $N$ cells numbered 1,2,....., N, and every cell has some positive value. you will be given an array $A_1$,$A_2$,…,$A_N$ where $A_i$ is the value of $ith$ cell and an integer $K$. There is a monkey who wants to reach the $right$ side of the last ($Nth$) cell, initially, the monkey was left side of the first ($1st$) cell. In the first step, he can jump into any cell numbered 1,2,.....,