#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};

int mod = 1000000007;
//int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

int modpow(int x, int n, int m){
    int a = 1;
    IREP(i, 64){
        a = (a * a) % m;
        if(((n >> i) & 1) == 1) a = (a * x) % m;
    }
    return a;
}

int BinaryMat_calcrank(mat A){
    int n = A.size(), m = A[0].size();
    int r = 0, j = 0;
    REP(i, n){
        bool f = false;
        while(!f && j < m){
            FOR(i2, i, n){
                if(A[i2][j]){
                    A[i].swap(A[i2]);
                    r++;
                    f = true;
                    break;
                }
            }
            if(f){
                FOR(i2, i + 1, n) if(A[i2][j]){
                    FOR(j2, j, m) A[i2][j2] ^= A[i][j2];
                }
            }
            j++;
        }
    }
    return r;
}

signed main(){

    int N, M, X; cin >> N >> M >> X;
    vec A(N); readv(A);
    vec t(M), l(M), r(M);
    REP(i, M){
        cin >> t[i] >> l[i] >> r[i];
        l[i]--; r[i]--;
    }
    int b = 30;
    mat U(b + M, vec(N, 0));
    vec v(b + M, 0);
    REP(i, N){
        REP(j, b) if((A[i] >> j) & 1) U[j][i] = 1;
    }
    REP(j, b) if((X >> j) & 1) v[j] = 1;

    REP(i, M){
        FOR(j, l[i], r[i] + 1) U[b + i][j] = 1;
        v[b + i] = t[i];
    }
    int f1 = N - BinaryMat_calcrank(U);
    //mdebug(U);
    //debug(f1);
    REP(i, b + M) U[i].pb(v[i]);
    int f2 = N - BinaryMat_calcrank(U);
    Ans(f1 == f2, modpow(2, f1, mod), 0);

    return 0;
}