Problem Description

Everyone in the HDU knows that the number of boys is larger than the number of girls. But now, every boy wants to date with pretty girls. The girls like to date with the boys with higher IQ. In order to test the boys ' IQ, The girls make a problem, and the boys who can solve the problem  correctly and cost less time can date with them. The problem is that : give you n positive integers and an integer k. You need to calculate how many different solutions the equation x + y = k has . x and y must be among the given n integers. Two solutions are different if x0 != x1 or y0 != y1. Now smart Acmers, solving the problem as soon as possible. So you can dating with pretty girls. How wonderful!

 

Input

The first line contain an integer T. Then T cases followed. Each case begins with two integers n(2 <= n <= 100000) , k(0 <= k < 2^31). And then the next line contain n integers.

 

Output

For each cases,output the numbers of solutions to the equation.

 

Sample Input

 

Sample Output

#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cmath>

using namespace std;

#define mem(x,y) memset(x,y,sizeof(x))

const int INF=0x3f3f3f3f;

const double PI=acos(-1.0);

const int MAXN=;

int m[MAXN],k;

bool erfen(int l,int r,int x){

    int mid;

    while(l<=r){

        mid=(l+r)>>;

        if(x+m[mid]==k){

        //    printf("%d %d\n",x,m[mid]);

            return true;

        }

        if(x+m[mid]>=k)r=mid-;

        else l=mid+;

    }

    return false;

}

int main(){

    int T,n;

    scanf("%d",&T);

    while(T--){

        scanf("%d%d",&n,&k);

        for(int i=;i<=n;i++)scanf("%d",m+i);

        m[]=-INF;

        sort(m,m+n+);

        int cnt=;

        for(int i=;i<=n;i++){

            if(m[i]>k||m[i]==m[i-])continue;

            if(erfen(,n,m[i]))cnt++;

        }

        printf("%d\n",cnt);

    }

    return ;

}

 #include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<map>

 const int INF=0x3f3f3f3f;

 using namespace std;

 const int MAXN=;

 map<int,int>mp;

 int m[MAXN];

 int main(){

     int T,n,k;

     scanf("%d",&T);

     while(T--){

         mp.clear();

         scanf("%d%d",&n,&k);

         m[]=-INF;

         for(int i=;i<=n;i++){

             scanf("%d",m+i);

             if(!mp[m[i]])

                 mp[m[i]]=;

             else i--,n--;

         //    cout<<m[i]<<mp[m[i]]<<endl;

         }

         int cnt=;

         for(int i=;i<=n;i++){

             if(m[i]>k)continue;

             if(mp[k-m[i]])cnt++;

         }

         printf("%d\n",cnt);

     }

     return ;

 }

 #include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<set>

 const int INF=0x3f3f3f3f;

 using namespace std;

 const int MAXN=;

 set<int>st;

 int m[MAXN];

 int main(){

     int T,n,k,temp;

     scanf("%d",&T);

     while(T--){

         st.clear();

         scanf("%d%d",&n,&k);

         for(int i=;i<n;i++){

             scanf("%d",&temp);

             st.insert(temp);

         }

         set<int>::iterator iter;

         int cnt=;

         for(iter=st.begin();iter!=st.end();iter++)

             if(st.count(k-*iter))cnt++;

         printf("%d\n",cnt);

     }

     return ;

 }