#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const int M = 1<<10;

#define MOD 1000000007
template<int mod>
struct ModInt{
   int x;
   ModInt():x(0){}
   ModInt(long long y):x(y>=0?y%mod:(mod-(-y)%mod)%mod){}
   ModInt &operator+=(const ModInt &p){
	   if((x+=p.x)>=mod)x-=mod;
	   return *this;
   }
   ModInt &operator-=(const ModInt &p){
	   if((x+=mod-p.x)>=mod)x-=mod;
	   return *this;
   }
   ModInt &operator*=(const ModInt &p){
	   x=(int)(1LL*x*p.x%mod);
	   return *this;
   }
   ModInt &operator/=(const ModInt &p){
	   *this*=p.inverse();
	   return *this;
   }
   ModInt &operator^=(long long p){
	   ModInt res = 1;
	   for (; p; p >>= 1) {
		   if (p & 1) res *= *this;
		   *this *= *this;
	   }
	   return *this = res;
   }
   ModInt operator-()const{return ModInt(-x);}
   ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
   ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
   ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
   ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
   ModInt operator^(long long p)const{return ModInt(*this)^=p;}
   bool operator==(const ModInt &p)const{return x==p.x;}
   bool operator!=(const ModInt &p)const{return x!=p.x;}
   explicit operator int() const { return x; }
   ModInt operator=(const int p) {x = p; return ModInt(*this);}
   ModInt inverse()const{
	   int a=x,b=mod,u=1,v=0,t;
	   while(b>0){
		   t=a/b;
		   a-=t*b;
		   std::swap(a,b);
		   u-=t*v;
		   std::swap(u,v);
	   }
	   return ModInt(u);
   }
   friend std::ostream &operator<<(std::ostream &os,const ModInt<mod> &p){
	   return os<<p.x;
   }
   friend std::istream &operator>>(std::istream &is,ModInt<mod> &a){
	   long long x;
	   is>>x;
	   a=ModInt<mod>(x);
	   return (is);
   }
};
typedef ModInt<MOD> mint;
 

int main()
{
	int n, k; cin >> n >> k;
	vector<int> a(M);
	for(int i = 0; i < n; i++) {
		int t; cin >> t;
		a[t]++;
	}
	if(k >= 12) {
		cout << 0 << endl;
		return 0;
	}

	vector<vector<vector<mint>>> dp(M + 1, vector<vector<mint>>(k + 1, vector<mint>(M)));
	dp[0][0][0] = 1;

	for(int i = 0; i < M; i++) {
		for(int j = 0; j <= k; j++) {
			for(int t = 0; t < M; t++) {

				//取らない
				dp[i + 1][j][t] += dp[i][j][t];

				//取る
				if(j != k && (i + t) == (i xor t)) {
					dp[i + 1][j + 1][t xor i] += dp[i][j][t] * a[i];
				}
			}
		}
	}

	mint sum = 0;
	for(int i = 0; i < M; i++) {
		sum += dp[M][k][i];
	}
	cout << sum << endl;

}