#include <bits/stdc++.h>
using namespace std;
int calcBitCnt(long long A) {
  int cnt = 0;
  while (A) {
    if (A & 1) cnt++;
    A = A >> 1;
  }
  return cnt;
}
long long ww[100][100][2], res[100][100][2];
long long a[100];
int n;
void wwSQR(int ind) {
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      ww[i][j][1 - ind] = 0;
      for (int q = 0; q < n; q++)
        ww[i][j][1 - ind] =
            (ww[i][j][1 - ind] + ww[i][q][ind] * ww[q][j][ind]) % 1000000007;
    }
}
void multRes(int indRes, int indWW) {
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      res[i][j][1 - indRes] = 0;
      for (int q = 0; q < n; q++)
        res[i][j][1 - indRes] =
            (res[i][j][1 - indRes] + res[i][q][indRes] * ww[q][j][indWW]) %
            1000000007;
    }
}
int fastPow(long long p) {
  int indRes = 0;
  int indWW = 0;
  while (p) {
    if (p & 1) {
      multRes(indRes, indWW);
      indRes = (indRes + 1) % 2;
    }
    wwSQR(indWW);
    indWW = (indWW + 1) % 2;
    p = p >> 1;
  }
  return indRes;
}
int main() {
  long long k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      ww[i][j][0] = (calcBitCnt(a[i] ^ a[j]) % 3 == 0);
  for (int i = 0; i < n; i++) res[i][i][0] = 1;
  int d = fastPow(k - 1);
  long long rr = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) rr += res[i][j][d];
  rr = rr % 1000000007;
  cout << rr;
  return 0;
}
