#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int NAX = 1e2 + 5, MOD = 1000000007;
ll arr[NAX];
int **unit, **two, **zero;
int n;
struct Solution {
  int **cross(int **a, int **b) {
    int **ret;
    ret = (int **)malloc(n * (sizeof(int *)));
    for (size_t i = 0; i < n; i++) {
      ret[i] = (int *)malloc(n * (sizeof(int)));
      for (size_t j = 0; j < n; j++) {
        ret[i][j] = 0;
        for (size_t k = 0; k < n; k++)
          ret[i][j] = (ret[i][j] + a[i][k] * 1LL * b[k][j]) % MOD;
      }
    }
    return ret;
  }
  int **expo(ll idx) {
    int **ret;
    if (idx == 0) return unit;
    auto temp = expo(idx / 2);
    ret = cross(temp, temp);
    if (idx & 1) ret = cross(ret, two);
    return ret;
  };
  Solution() {}
  void solveCase() {
    cin >> n;
    ll k;
    cin >> k;
    unit = (int **)malloc(n * (sizeof(int *)));
    zero = (int **)malloc(n * (sizeof(int *)));
    two = (int **)malloc(n * (sizeof(int *)));
    for (size_t i = 0; i < n; i++) {
      cin >> arr[i];
      unit[i] = (int *)malloc(n * (sizeof(int)));
      zero[i] = (int *)malloc(n * (sizeof(int)));
      two[i] = (int *)malloc(n * (sizeof(int)));
      for (size_t j = 0; j < n; ++j) unit[i][j] = zero[i][j] = two[i][j] = 0;
      unit[i][i] = 1;
    }
    for (size_t i = 0; i < n; i++)
      for (size_t j = 0; j < n; j++) {
        ll temp = arr[i] ^ arr[j];
        temp = __builtin_popcountll(temp);
        two[i][j] = (temp % 3) == 0;
      }
    auto ret = expo(k - 1);
    int res = 0;
    for (size_t i = 0; i < n; i++)
      for (size_t j = 0; j < n; j++) res = (res + 0LL + ret[i][j]) % MOD;
    cout << res << '\n';
  }
};
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  Solution mySolver;
  for (int i = 1; i <= t; ++i) {
    mySolver.solveCase();
  }
  return 0;
}
