#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const int mxN = 105;
const int MOD = 1e9 + 7;
template <class T>
T gcd(T a, T b) {
  return ((b == 0) ? a : gcd(b, a % b));
}
struct matrix {
  long long mat[mxN][mxN];
  matrix() {
    for (int i = 0; i < (int)(mxN); i++)
      for (int j = 0; j < (int)(mxN); j++) mat[i][j] = 0;
  }
};
long long a[mxN];
int n;
bool good(long long a1, long long b) {
  long long nm = a1 ^ b;
  int ans = 0;
  for (int i = 0; i < 63; i++)
    if ((1LL << i) & nm) ans++;
  return (ans % 3 == 0);
}
matrix mul(matrix a1, matrix b) {
  matrix c;
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(n); j++)
      for (int k = 0; k < (int)(n); k++) {
        (c.mat[i][j] += (a1.mat[i][k] * b.mat[k][j]) % MOD) %= MOD;
      }
  return c;
}
matrix binPow(matrix a, long long n) {
  matrix res = a;
  n--;
  while (n > 0) {
    if (n & 1) res = mul(res, a);
    a = mul(a, a);
    n /= 2;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long k;
  cin >> n >> k;
  matrix cur;
  for (int i = 0; i < (int)(n); i++) cin >> a[i];
  if (k == 1) {
    cout << n << endl;
    return 0;
  }
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(n); j++)
      if (good(a[i], a[j])) cur.mat[i][j] = 1;
  k--;
  matrix ans = binPow(cur, k);
  long long res = 0LL;
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(n); j++) (res += ans.mat[i][j]) %= MOD;
  cout << res << endl;
  return 0;
}
