#include <iostream>

 #include <stdio.h>

 #define ll long long

 using namespace std;

 const int MAXN = 1e5 + ;

 ll a[MAXN], vis[MAXN];

 int BitCount(unsigned int n){//求 n 二进制中 1 的数目

     unsigned int tmp = n - ((n >> ) & ) - ((n >> ) & );

     return ((tmp + (tmp >> )) & ) % ;

 }

 int main(void){

     int n, k, x, indx = ;

     ll ans = ;

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

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

         scanf("%d", &x);

         if(!vis[x]) a[indx++] = x;

         vis[x]++;

     }

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

         if(k == ){

             ans += (vis[a[i]] - ) * vis[a[i]] / ;

             continue;

         }

         for(int j = i + ; j < indx; j++){

             int cnt = a[i] ^ a[j];

             if(k == BitCount(cnt)) ans += vis[a[i]] * vis[a[j]];

         }

     }

     printf("%lld\n", ans);

     return ;

 }