#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

vector<int> a(100005);
int n,x;

bool binary_search(int x){
  int l = 0,r = n;
  int mid = (l+r)/2;
  while(r-l > 0){
    if(a[mid] == x){
      return true;
    }else if(a[mid] < x){
      l = mid;
    }else if(a[mid] > x){
      r = mid;
    }
  }
  return false;
}

int main(){
    
    cin >> n >> x;
    
    for(int i=0;i < n;i++){
        cin >> a[i];
    }
    
    sort(a.begin(),a.end());
    
    int ans = 0;
    
    for(int i=0;i < n;i++){
        if(binary_search(x - a[i])) ans++;
    }
    cout << ans << endl;
    return 0;
}