#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <sstream>
#include <typeinfo>
#include <fstream>

#define DIV 1000000007

using namespace std;

long long n, k;
long long a[105];
//           idx, num, xor
long long dp[105][105][260];

long long memo[200];

int main(){
	memo[0] = 1;
	for(int i = 1; i < 200; i++){
		memo[i] = memo[i-1] * i;
		memo[i] %= DIV;
	}

	cin >> n >> k;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	dp[0][0][0] = 1;
	for(int i = 0; i < n; i++){
		for(int num = 0; num < 105; num++){
			for(int j = 0; j < 260; j++){
				if(dp[i][num][j]){
					/*
					cout << "dp[" << i + 1  << "][" << j << "] += " << dp[i][j] << endl;
					cout << "dp[" << i + 1  << "][" << (j^a[i]) << "] += " << dp[i][j] << endl;
					*/
					dp[i+1][num][j] += dp[i][num][j];
					dp[i+1][num+1][j^a[i]] += dp[i][num][j];
					dp[i+1][num][j] %= DIV;
					dp[i+1][num+1][j^a[i]] %= DIV; 

				}
			}
		}
	}
	/*
	for(int i = 0; i <= n; i++){
		for(int j = 0; j < 30; j++){
			cout << "dp[" << i << "][" << j << "]=" << dp[i][j] << endl;
		}
	}
	*/

	long long ans = 0;
	for(int num = 0; num < 105; num++){
		//cout << "num:" << dp[n][num][k] << endl;
		ans += (memo[num] * dp[n][num][k])%DIV ;
		ans %= DIV;
	}

	cout << ans << endl;



}
