Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less than k friends in common, they will become friends in several days. Currently, there are totally n people in the country, and m friendship among them. Assume that any new friendship is made only when they have sufficient friends in common mentioned above, you are to tell how many new friendship are made after a sufficiently long time.

Input

There are multiple test cases.

The first lien of the input contains an integer T (about 100) indicating the number of test cases. Then T cases follow. For each case, the first line contains three integersn, m, k (1 ≤ n ≤ 100, 0 ≤ m ≤ n×(n-1)/2, 0 ≤ k ≤ n, there will be no duplicated friendship) followed by m lines showing the current friendship. The ith friendship contains two integers u_i, v_i (0 ≤ u_i, v_i < n, u_i ≠ v_i) indicating there is friendship between person u_i and v_i.

Note: The edges in test data are generated randomly.

Output

For each case, print one line containing the answer.

Sample Input

34 4 20 10 21 32 35 5 20 11 22 33 44 05 6 20 11 22 33 44 02 0

Sample Output

204

Author: ZHUANG, Junyuan

题目大意：给定你n个点  然后给定m条边 如果2个不相连的点和其他不小于k个点都相连，那么它们两之间就产生一条新边 问你最后一共产生多少条新边

解题思路：纯暴力解法，每次重新开始计算是否可以建立新边，直至不能建立为止。[这种暴力解法的思路值得学习一下，暴力枚举，直到状态不再变化停止]

1 #include
       
         2 #include
        
          3 #include
         
           4 #include
          
            5 using namespace std; 6 int main(){ 7     int T; 8     cin>>T; 9     int map[105][105];//存放关系的矩阵10     while(T--){11         memset(map,0,sizeof(map));12         int n,m,k;13         cin>>n>>m>>k;14         for(int i=0;i
           
            >u>>v;17             map[u][v]=1;18             map[v][u]=1;19         }20 21         bool ok=1;22         int num=0;23         while(ok){
     //纯暴解法，直至不能产生新边结束24             ok=0;25             for(int i=0;i
            
             =k){ //如果不小于k就相连32 num++;33 map[i][j]=map[j][i]=1;34 ok=1;35 }36 }37 }38 }39 40 cout<
             
              <<'\n';41 }return 0;42 }