#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n, k, bang[105];
struct Matrix {
  long long m[105][105];
  Matrix() { memset(m, 0, sizeof m); }
  Matrix operator*(const Matrix &oth) {
    Matrix ret;
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) {
        for (long long k = 0; k < n; k++) {
          ret.m[i][j] = (ret.m[i][j] + m[i][k] * oth.m[k][j] % mod) % mod;
        }
      }
    }
    return ret;
  }
} unit, base;
Matrix bp(Matrix a, long long n) {
  Matrix ret = unit;
  while (n) {
    if (n & 1) ret = ret * a;
    a = a * a;
    n >>= 1;
  }
  return ret;
}
signed main() {
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> bang[i];
  for (long long i = 0; i < n; i++) {
    unit.m[i][i] = 1;
  }
  Matrix phuk;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      long long hungham = __builtin_popcountll(bang[i] ^ bang[j]);
      if (hungham % 3 == 0)
        phuk.m[i][j] = 1;
      else
        phuk.m[i][j] = 0;
    }
  }
  Matrix ham;
  for (long long i = 0; i < n; i++) ham.m[0][i] = 1;
  Matrix ans;
  Matrix luy = bp(phuk, k - 1);
  if (k == 1)
    ans = ham;
  else {
    ans = ham * luy;
  }
  long long dum = 0;
  for (long long i = 0; i < n; i++) dum = (dum + ans.m[0][i]) % mod;
  cout << dum;
}
