#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

int B[410][410];
int N, M, X;

void solve() {
	cin >> N >> M >> X;
	int S = max(30 + M, N);
	rep(i, 0, N) {
		int a; cin >> a;
		rep(j, 0, 30) {
			B[j][i] = ((1 << j) & a) ? 1 : 0;
		}
	}
	rep(j, 0, 30) B[j][S] = ((1 << j) & X) ? 1 : 0;
	rep(i, 0, M) {
		int e, l, r;
		cin >> e >> l >> r; l--;
		rep(j, l, r) B[i + 30][j] = 1;
		B[i + 30][S] = e;
	}
	rep(i, 0, S) {
		int pivot = -1;
		rep(j, i, S) {
			if(B[j][i]) pivot = j;
		}
		if(pivot == -1) continue;
		swap(B[i], B[pivot]);

		rep(j, 0, S) {
			if(i != j && B[j][i]) {
				rep(k, 0, S + 1) B[j][k] ^= B[i][k];
			}
		}
	}
	// rep(i, 0, S) debug(vi(B[i], B[i] + S + 1));
	int r = 0;
	rep(i, 0, S) {
		if(B[i][i] == 1) r++;
		else {
			if(B[i][S]) r = -inf;
		}
	}
	if(r < 0) cout << 0 << "\n";
	else cout << mod_pow(2, N - r) << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}