#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int nth_bit(int64_t num, int n) {
	return (num >> n) & 1;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, x; cin >> n >> m >> x;
	vector<vector<int>>a(n, vector<int>(m + 30));
	rep(i, n) {
		int _a;
		cin >> _a;
		rep(j, 30) a[i][m + j] = nth_bit(_a, j);
	}
	vector<int>c(m + 30);
	rep(i, 30) {
		c[m + i] = nth_bit(x, i);
	}
	rep(i, m) {
		int t, l, r; cin >> t >> l >> r;
		l--, r--;
		c[i] = t;
		rep2(j, l, r + 1)a[j][i] = 1;
	}
	int sz = m + 30;
	int rank = 0;
	vector<int>row(sz, -1);
	rep(i, sz) {
		int pivot = -1;
		rep2(j, rank, n) {
			if (a[j][i]) {
				pivot = j;
				break;
			}
		}
		if (-1 == pivot)continue;
		row[i] = rank;
		if (rank != pivot) swap(a[pivot], a[rank]);

		rep(j, n) {
			if (j != rank && a[j][i]) {
				rep(k, sz) {
					a[j][k] ^= a[rank][k];
				}
			}
		}
		rank++;
	}
	vector<int>v(sz);
	rep(i, sz) {
		if (c[i]) {
			if (-1 != row[i]) {
				rep(j, sz)v[j] ^= a[row[i]][j];
			}
		}
	}
	rep(i, sz) {
		if (v[i] != c[i]) {
			cout << 0 << endl;
			return 0;
		}
	}
	mint ans = 1;
	rep(i, n) {
		bool chk = true;
		rep(j, sz)if (0 != a[i][j])chk = false;
		if (chk)ans *= 2;
	}
	cout << ans.val() << endl;
	return 0;
}