you are given an array A$,$ consisting of N integers and an integer M$.$ The D$\_$Value of a subsequence H of length K is defined as: D$\_$Value $=$ max $(0,$ h$[$i$+1]-1)+$ max $(0,$ H$[$i$+2]-2)+....+$max$(0,$ H$[$i$+$k$]-($k$-1)),$ where i$=0$

You can perform the folloeing operation on Array A:

$1.$ Select a subsequence S in array A

$2.$ Remove those elements from A that have been selected in S

$3.$ Reshuffle the subsequence S$,$ if need be$,$ and compute the D$\_$value of the re$-$shuffled subsequence.

$4.$ Assign M$=$M$-$D$\_$value

Your task is to find and return an integer value representing the count of minimum number of operations required to make the integer M$<=0.$