Given an Array \(A\) of $$N$$ integers.You have to find number of subarrays having $$Primicity$$ less than or equal to $$K$$.

$$Primicity$$ of sub-array is defined an number of primes in that subarray.

Input:

First line contains \(N\) and \(K\).

Second line contains \(N\) integers.

Output:

Print the Number of sub-arrays having $$Primicity$$ \(\leq\)$$K$$.

Constraints:

\(1\leq N,K\leq 10^5\)

\(1\leq A[i]\leq 10^7\)