#include <bits/stdc++.h>
using namespace std;
long long valid[102][102];
long long ans;
long long v[102][102];
long long n, k;
long long a[102];
void mul(long long a[102][102], long long b[102][102]) {
  int d[102][102] = {};
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= n; k++)
        d[i][j] = (d[i][j] + a[i][k] * b[k][j] % 1000000007) % 1000000007;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) a[i][j] = d[i][j];
}
void func() {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      valid[i][j] = (__builtin_popcountll(a[i] ^ a[j]) % 3 == 0);
  k--;
  while (k) {
    if (k % 2 == 1) mul(v, valid);
    mul(valid, valid);
    k = k / 2;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) ans = (ans + v[i][j]) % 1000000007;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    v[i][i] = 1;
  }
  func();
  cout << ans << endl;
  return 0;
}
