#include <iostream>
#include <algorithm>
#include <vector>
#include <bitset>
 
using namespace std;

#define REP(i, n) for (int i = 0; i < (n); i++)

const int MOD = 1e9 + 7;

struct mint {
    int n;
    mint(int n_ = 0) : n(n_) {}
};

mint operator+(mint a, mint b) { a.n += b.n; if (a.n >= MOD) a.n -= MOD; return a; }
mint operator-(mint a, mint b) { a.n -= b.n; if (a.n < 0) a.n += MOD; return a; }
mint operator*(mint a, mint b) { return (long long)a.n * b.n % MOD; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }

struct lin {
  vector<bitset<301>> B;

  void insert(bitset<301> a) {
    for (auto x : B) if ((a ^ x).to_string() < a.to_string()) a ^= x;
    if (a.any()) B.push_back(a);
  }
};

int main() {
  int N, M, X;
  cin >> N >> M >> X;
  vector<int> A(N);
  REP(i, N) cin >> A[i];
  lin S, T;
  REP(i, 30) {
    bitset<301> x;
    REP(j, N) x[j] = A[j] >> i & 1;
    S.insert(x);
    x[300] = X >> i & 1;
    T.insert(x);
  }
  REP(i, M) {
    int t, l, r;
    cin >> t >> l >> r;
    bitset<301> x;
    for (int i = l - 1; i < r; i++) x[i] = 1;
    S.insert(x);
    x[300] = t;
    T.insert(x);
  }
  mint ans = 1;
  REP(i, N - S.B.size()) ans *= 2;
  if (S.B.size() != T.B.size()) ans = 0;
  cout << ans.n << '\n';
}