#include <bits/stdc++.h>
long long n, k;
long long m1[100][100], m2[100][100], m3[100][100];
long long a[100];
long long bitcnt(long long x) {
  long long cnt = 0;
  while (x) {
    cnt += x & 1;
    x >>= 1;
  }
  return cnt;
}
int main() {
  scanf("%d%lld", &n, &k);
  for (int i = 0; i < n; i++) scanf("%lld", a + i);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) m1[i][j] = bitcnt(a[i] ^ a[j]) % 3 == 0;
  k--;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) m2[i][j] = i == j;
  while (k) {
    if (k & 1) {
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) m3[i][j] = 0;
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
          for (int k = 0; k < n; k++)
            m3[i][k] =
                (m3[i][k] + (m1[i][j] * m2[j][k]) % 1000000007) % 1000000007;
      for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) m2[i][j] = m3[i][j];
    }
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) m3[i][j] = 0;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++)
        for (int k = 0; k < n; k++)
          m3[i][k] =
              (m3[i][k] + (m1[i][j] * m1[j][k]) % 1000000007) % 1000000007;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) m1[i][j] = m3[i][j];
    k >>= 1;
  }
  long long sum = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) sum = (sum + m2[i][j]) % 1000000007;
  printf("%lld\n", sum);
  return 0;
}
