"It does not matter how slowly you go as long as you do not stop." - Confucius
You are given an array $A_1, A_2, \ldots, A_N$ and an integer $K$. For each subarray $S = [A_l, A_{l+1}, \ldots, A_r]$ ($1 \le l \le r \le N$):
- Let's define an array $B$ as $S$ concatenated with itself $m$ times, where $m$ is the smallest integer such that $m(r-l+1) \ge K$.
- Next, let's sort $B$ and define $X = B_K$, i.e. as a $K$-th smallest element of $B$. Note that $|B| \ge K$.
- Then, let's define $F$ as the number of occurrences of $X$ in $S$.
- The subarray $S$ is beautiful if $F$ occurs in $S$ at least once.
Find the number of beautiful subarrays of $A$. Two subarrays $A_l, A_{l+1}, \ldots, A_r$ and $A_p, A_{p+1}, \ldots, A_q$ are different if $l \neq p$ or $r \neq q$.
-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains two space-separated integers $N$ and $K$. 
- The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$.
-----Output-----
For each test case, print a single line containing one integer - the number of beautiful subarrays.
-----Constraints-----
- $1 \le T \le 5$
- $1 \le N \le 2,000$
- $1 \le K \le 10^9$
- $1 \le A_i \le 2000$ for each valid $i$
-----Subtasks-----
Subtask #1 (20 points): $1 \le N \le 200$
Subtask #2 (80 points): original constraints
-----Example Input-----
1
3 3
1 2 3
-----Example Output-----
3
-----Explanation-----
Example case 1: There are six subarrays of $A$: $[1]$, $[2]$, $[3]$, $[1, 2]$, $[2, 3]$, $[1, 2, 3]$. The corresponding arrays $B$ are $[1, 1, 1]$, $[2, 2, 2]$, $[3, 3, 3]$, $[1, 2, 1, 2]$, $[2, 3, 2, 3]$, $[1, 2, 3]$.
Three of the subarrays are beautiful: $[1]$, $[1, 2]$ and $[1, 2, 3]$. For these subarrays, $X$ is $1$, $2$ and $3$ respectively (for example, for $S = [1, 2]$, $B = [1, 2, 1, 2]$ is sorted to $[1, 1, 2, 2]$ and $X = 2$ is the $3$-rd element). Then, $F = 1$ for each of these subarrays, and each of these subarrays contains $1$.
import bisect as b
t=int(input())
while(t):
 t-=1
 n,k=map(int,(input().split()))
 a=list(map(int,input().split()))
 c=0
 for i in range(n):
  x=[0]
  for j in range(i,n):
   b.insort(x,a[j])
   y=k/(len(x)-1)
   if(int(y)!=y):
    y=int(y)+1
   y=int(y)
   z=k/y
   if(int(z)!=z):
    z=int(z)+1
   z=int(z)
   q=1
   l=z-1
   while(l>=0):
    if(x[l]!=x[z]):
     break
    q+=1
    l-=1
   l=z+1
   #print(x,l)
   while(l<len(x)):
    if(x[l]!=x[z]):
     break
    l+=1
    q+=1
   l=b.bisect(x,q)
   if(x[l-1]==q):
    c+=1
 print(c)
import bisect as b
t=int(input())
while(t):
 t-=1
 n,k=map(int,(input().split()))
 a=list(map(int,input().split()))
 c=0
 for i in range(n):
  x=[0]
  for j in range(i,n):
   b.insort(x,a[j])
   y=k/(len(x)-1)
   if(int(y)!=y):
    y=int(y)+1
   y=int(y)
   z=k/y
   if(int(z)!=z):
    z=int(z)+1
   z=int(z)
   q=1
   l=z-1
   while(l>=0):
    if(x[l]!=x[z]):
     break
    q+=1
    l-=1
   l=z+1
   #print(x,l)
   while(l<len(x)):
    if(x[l]!=x[z]):
     break
    l+=1
    q+=1
   l=b.bisect(x,q)
   if(x[l-1]==q):
    c+=1
 print(c)