#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include<bits/stdc++.h>
#include<queue>
#include<deque>
#include<stack>
#include<set>
using namespace std;
void fast()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


}

void george_dictator_2()
{
    int n,k;
    cin>>n>>k;
    vector<int>v(n);
    vector<int>freq(2000001,0),freq_ne(2000001,0);
    for(int i=0; i<n; i++)
    {
        cin>>v[i];
        if(v[i]<0)
        {
            freq_ne[v[i]*-1]++;
        }
        else
        {
            freq[v[i]]++;
        }
    }
    sort(v.begin(),v.end());
    long long cont=0;


        for(int i=0; i<n; i++)
    {
       int  x=k-v[i];

        if(x<0)
        {
          if(x==v[i])
          {
              cont+=freq_ne[x*-1]-1;
          }

            else{
                    cont+=freq_ne[x*-1];
            }
        }
        else
        {
            if(x==v[i])
            {
                cont+=freq[x]-1;
            }
            else
            {
                cont+=freq[x];
            }
        }
        if(v[i]<0)
        {
            if(freq_ne[v[i]*-1]>0)
            {
                freq_ne[v[i]*-1]--;

            }

        }
        else
        {
            if(freq[v[i]]>0)
            {
                freq[v[i]]--;
            }
        }

    }

    cout<<cont;

}


int main()
{
    fast();


    george_dictator_2();


    return 0;
}