Masha works in an advertising agency. In order to promote the new brand, she wants to conclude contracts with some bloggers. In total, Masha has connections of n different bloggers. Blogger numbered i has a_i followers.

Since Masha has a limited budget, she can only sign a contract with k different bloggers. Of course, Masha wants her ad to be seen by as many people as possible. Therefore, she must hire bloggers with the maximum total number of followers.

Help her, find the number of ways to select k bloggers so that the total number of their followers is maximum possible. Two ways are considered different if there is at least one blogger in the first way, which is not in the second way. Masha believes that all bloggers have different followers (that is, there is no follower who would follow two different bloggers).

For example, if n=4, k=3, a=[1, 3, 1, 2], then Masha has two ways to select 3 bloggers with the maximum total number of followers: 

  * conclude contracts with bloggers with numbers 1, 2 and 4. In this case, the number of followers will be equal to a_1 + a_2 + a_4 = 6. 
  * conclude contracts with bloggers with numbers 2, 3 and 4. In this case, the number of followers will be equal to a_2 + a_3 + a_4 = 6. 



Since the answer can be quite large, output it modulo 10^9+7.

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases. Then t test cases follow.

The first line of each test case contains two integers n and k (1 ≤ k ≤ n ≤ 1000) — the number of bloggers and how many of them you can sign a contract with.

The second line of each test case contains n integers a_1, a_2, … a_n (1 ≤ a_i ≤ n) — the number of followers of each blogger.

It is guaranteed that the sum of n over all test cases does not exceed 1000.

Output

For each test case, on a separate line output one integer — the number of ways to select k bloggers so that the total number of their followers is maximum possible.

Example

Input


3
4 3
1 3 1 2
4 2
1 1 1 1
2 1
1 2


Output


2
6
1

Note

The test case is explained in the statements.

In the second test case, the following ways are valid: 

  * conclude contracts with bloggers with numbers 1 and 2. In this case, the number of followers will be equal to a_1 + a_2 = 2; 
  * conclude contracts with bloggers with numbers 1 and 3. In this case, the number of followers will be equal to a_1 + a_3 = 2; 
  * conclude contracts with bloggers with numbers 1 and 4. In this case, the number of followers will be equal to a_1 + a_4 = 2; 
  * conclude contracts with bloggers with numbers 2 and 3. In this case, the number of followers will be equal to a_2 + a_3 = 2; 
  * conclude contracts with bloggers with numbers 2 and 4. In this case, the number of followers will be equal to a_2 + a_4 = 2; 
  * conclude contracts with bloggers with numbers 3 and 4. In this case, the number of followers will be equal to a_3 + a_4 = 2. 



In the third test case, the following ways are valid: 

  * concludes a contract with a blogger with the number 2. In this case, the number of followers will be equal to a_2 = 2. 
import java.util.*;
import java.io.*;

public class E{
	static final long R = 1_000_000_007L;
	static long[] factor = new long[1001];
	
	static void init(){
		factor[0] = 1;
		for(int i = 1;i<=1000;++i){
			factor[i] = factor[i-1] * i %R;
		}
	}
	static long inv(long a){
		long x = R-2;
		long s = a;
		long res = 1;
		for(int i = 0;i<64;++i){
			if(((x >> i) & 1) == 1){
				res = (res * s) %R;
			}
			s = s*s %R;
		}
		return res;
	}
	
	public static void main(String[] args){
		MyScanner in = new MyScanner();
		StringBuilder res = new StringBuilder();
		int t = in.nextInt();
		init();
		//System.out.println(inv(1));
		o:while(t-- > 0){
			int n = in.nextInt();
			int k = in.nextInt();
			int[] ar = new int[1001];
			for(int i = 0;i<n;++i){
				ar[in.nextInt()]++;
			}
			int it = 1000;
			int K = k;
			while(K > 0){
				if(ar[it] < K){
					K -= ar[it];
					it--;
				} else{
					break;
				}
			}
			//System.out.println(Arrays.toString(ar));
			//System.out.println(K);
			//System.out.println(it);
			long r = 0;
			r = factor[ar[it]] *inv(factor[K]*factor[ar[it] - K]%R) %R;
			res.append(r + "\n");
			
		}
		
		System.out.println(res.toString());
		
	}
	
	static class MyScanner{
		BufferedReader bf;
		StringTokenizer st;
		
		MyScanner(){
			bf = new BufferedReader(new InputStreamReader(System.in));
		}
		
		public String nextToken(){
			try{
				while(st == null || !st.hasMoreTokens()){
					st = new StringTokenizer(bf.readLine());
				}
				return st.nextToken();
			} catch(Exception e){
				System.out.println("Problems");
			}
			return "";
		}
		
		public Integer nextInt(){
			return Integer.valueOf(nextToken());
		}
	}
}

