#include <bits/stdc++.h>
void build_population_count(unsigned int[]);
void read_and_find_frequency(int[], unsigned int);
unsigned long long count_k_interesting_pairs(int[], int, unsigned int[]);
int main() {
  int count[10000 + 1] = {0}, k;
  unsigned int population_count[2 * 10000], no_of_elements;
  unsigned long long no_of_k_interesting_pairs;
  scanf("%u %d", &no_of_elements, &k);
  build_population_count(population_count);
  read_and_find_frequency(count, no_of_elements);
  no_of_k_interesting_pairs =
      count_k_interesting_pairs(count, k, population_count);
  printf("%I64u\n", no_of_k_interesting_pairs);
  return 0;
}
void build_population_count(unsigned int population_count[]) {
  unsigned int i;
  population_count[0] = 0;
  for (i = 1; i <= 2 * 10000; i++) {
    population_count[i] = population_count[i >> 1] + (i % 2);
  }
}
unsigned long long count_k_interesting_pairs(int count[], int k,
                                             unsigned int population_count[]) {
  unsigned int i, j;
  unsigned long long k_interesting_count = 0;
  for (i = 0; i <= 10000; i++) {
    if (count[i] > 0) {
      if (k == 0) {
        k_interesting_count += (long long)count[i] * (count[i] - 1) / 2;
      } else {
        for (j = i + 1; j <= 10000; j++) {
          if ((count[j] > 0) && (population_count[i ^ j] == k)) {
            k_interesting_count += (long long)count[i] * count[j];
          }
        }
      }
    }
  }
  return k_interesting_count;
}
void read_and_find_frequency(int count[], unsigned int no_of_elements) {
  unsigned int num, i;
  for (i = 0; i < no_of_elements; i++) {
    scanf("%u", &num);
    count[num]++;
  }
}
