#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;

#define BS 303
pair<int, vector<bitset<BS>>> gaussianEliminationXor(vector<bitset<BS>> x) {
    int rank = 0;
    rep(i, 0, BS) {
        int m = -1;
        for (int j = rank; j < x.size(); j++) {
            if (x[j][i]) {
                m = j;
                break;
            }
        }
        if (m == -1) continue;
        swap(x[rank], x[m]);
        for (int j = 0; j < x.size(); j++) {
            if (rank != j && x[j][i]) {
                x[j] ^= x[rank];
            }
        }
        rank++;
    }
    return { rank, x };
}
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　  |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/






int N, M, X, A[303];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> M >> X;
    rep(i, 0, N) cin >> A[i];

    vector<bitset<BS>> v;
    rep(d, 0, 30) {
        bitset<BS> b;
        rep(i, 0, N) if (A[i] & (1 << d)) b.set(i);
        if (X & (1 << d)) b.set(N);
        v.push_back(b);
    }
    rep(m, 0, M) {
        int t, l, r; cin >> t >> l >> r;
        l--;

        bitset<BS> b;
        rep(i, l, r) b.set(i);
        if (t == 1) b.set(N);

        v.push_back(b);
    }

    auto p = gaussianEliminationXor(v);
    fore(b, p.second) if (b.count() == 1 and b[N]) {
        cout << 0 << endl;
        return;
    }
    mint ans = mint(2) ^ (N - p.first);
    cout << ans << endl;
}