#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) { return a.n == 0 ? 0 : MOD - a.n; }
mint operator+(mint a, mint b) { return (a.n += b.n) >= MOD ? a.n - MOD : a.n; }
mint operator-(mint a, mint b) { return (a.n -= b.n) < 0 ? a.n + MOD : a.n; }
mint operator*(mint a, mint b) { return 1LL * 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; }

int main() {
  int N, M, X;
  cin >> N >> M >> X;
  vector<int> A(N);
  // 0bit A[i]x = X
  REP(i, N) cin >> A[i];
  vector<bitset<301>> mat;
  REP(i, 30) {
    bitset<301> x;
    REP(j, N) {
      x[j] = A[j] >> i & 1;
    }
    x[300] = X >> i & 1;
    mat.push_back(x);
  }
  REP(i, M) {
    int t, l, r;
    cin >> t >> l >> r;
    l--;
    bitset<301> x;
    for (int i = l; i < r; i++) {
      x[i] = 1;
    }
    x[300] = t;
    mat.push_back(x);
  }
  int r = 0;
  for (int j = 0; j <= 300 && r < mat.size(); j++) {
    int k = -1;
    for (int i = r; i < mat.size(); i++) {
      if (mat[i][j]) {
        k = i;
        break;
      }
    }
    if (k == -1) continue;
    swap(mat[k], mat[r]);
    for (int i = r + 1; i < mat.size(); i++) {
      if (mat[i][j]) {
        mat[i] ^= mat[r];
      }
    }
    r++;
  }
  // dim(ker(mat)) + rank(mat) = N
  REP(i, mat.size()) {
    int z = 1;
    REP(j, N) {
      z &= !mat[i][j];
    }
    if (z && mat[i][300]) {
      cout << 0 << endl;
      return 0;
    }
  }
  mint ans = 1;
  REP(i, N - r) ans *= 2;
  cout << ans.n << endl;
}