#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int n;
long long a[101];
struct mat {
  int m[102][102];
  mat() { memset(m, 0, sizeof m); };
  mat operator*(const mat &rhs) {
    mat c;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; j++) {
        for (int k = 0; k < n; k++) {
          c.m[i][j] =
              1ll * (1ll * c.m[i][j] + 1ll * m[i][k] * 1ll * rhs.m[k][j]) % MOD;
        }
      }
    }
    return c;
  }
};
long long k;
mat init;
mat fast(mat a, long long b) {
  if (b == 1) return a;
  mat res = fast(a, b / 2);
  res = res * res;
  if (b & 1) return res * a;
  return res;
}
int cnt(long long x) {
  int res = 0;
  while (x) {
    res += x & 1;
    x /= 2;
  }
  return res;
}
int main() {
  scanf("%d%lld", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &a[i]);
  }
  k--;
  if (k == 0) {
    printf("%d\n", n);
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; j++) {
      if (cnt(a[i] ^ a[j]) % 3) continue;
      init.m[i][j]++;
    }
  }
  mat fn = fast(init, k);
  int res = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      res = (1ll * res + 1ll * fn.m[i][j]) % MOD;
    }
  }
  printf("%d\n", res);
  return 0;
}
