Maximum Sum

Jatin loves solving problems based on maximum sum. So here is another one. Given an array of Length $N$,we have to find the maximum sum which we can obtain from taking the elements of the array.We can take the elements of array in atmax $K$ steps(It is possible to make 0 steps then answer will be 0), where each step is considered as moving from index $i$ to either $i$+1 or $i$+2. i.e. From index