#include #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 pi; typedef pair pl; typedef pair ppi; typedef vector vi; typedef vector vl; typedef vector mat; typedef complex comp; void Debug() {cout << '\n'; } templatevoid Debug(FIRST arg, REST... rest){ cout<ostream& operator<<(ostream& out,const vector& v) { out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<ostream& operator<<(ostream& out,const pair& v){ out<<"("<> 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) debug(vi(B[i], B[i] + S + 1)); rep(i, 0, S) { int pivot = -1; rep(j, 0, S) { if(B[j][i] & !used[j]) pivot = j; } if(pivot == -1) continue; swap(B[i], B[pivot]); used[i] = true; 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; }