#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("0"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

// Mod int
const int mod = 1000000007;
struct mint {
  ll x;
  mint():x(0){}
  mint(ll x):x((x%mod+mod)%mod){}
  // mint(ll x):x(x){}
  mint& fix() { x = (x%mod+mod)%mod; return *this;}
  mint operator-() const { return mint(0) - *this;}
  mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
  mint operator+(const mint& a)const{ return mint(*this) += a;}
  mint operator-(const mint& a)const{ return mint(*this) -= a;}
  mint operator*(const mint& a)const{ return mint(*this) *= a;}
  bool operator<(const mint& a)const{ return x < a.x;}
  bool operator==(const mint& a)const{ return x == a.x;}
};
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}
typedef vector<mint> vm;
//

// Matrix
struct mat {
  typedef int TT;
  //typedef mint TT;
  int h, w;
  vv(TT) d;
  mat(){}
  mat(int h, int w, TT v=0):h(h),w(w),d(h,vector<TT>(w,v)){}
  v(TT)& operator[] (int i) { return d[i];}
  const v(TT)& operator[] (int i) const { return d[i];}
  void gauss() { // 01
    int r = 0;
    rep(i,w-1) {
      int j;
      if (!d[r][i]) {
        for (j = r+1; j < h; j++) {
          if (d[j][i]) {
            swap(d[r],d[j]);
            break;
          }
        }
        if (j == h) continue;
      }
      rep(k,h) {
        if (r == k) continue;
        for (j = w-1; j >= i; j--) d[k][j] ^= (d[r][j]&d[k][i]);
      }
      if (++r >= h) break;
    }
  }
  void pri() {
    rep(i,h) {
      cout << "|";
      rep(j,w) cout << " " << d[i][j];
      cout << " |" << endl;
    }
    cout<<endl;
  }
};
//



int main() {
  int n,m,x;
  scanf("%d%d%d",&n,&m,&x);
  vi a(n);
  cin>>a;
  int w = 30;
  mat d(w+m,n+1);
  rep(i,m) {
    int ty,l,r;
    scanf("%d%d%d",&ty,&l,&r);
    --l;
    srep(j,l,r) d[i][j] = 1;
    d[i][n] = ty;
  }
  rep(i,w) {
    rep(j,n) d[m+i][j] = a[j]>>i&1;
    d[m+i][n] = x>>i&1;
  }
  d.gauss();
  int rank = 0;
  rep(i,d.h) {
    bool ok = false;
    rep(j,n) if (d[i][j]) ok = true;
    if (ok) rank++;
    if (!d[i][n]) ok = true;
    if (!ok) dame;
  }
  // d.pri();
  mint ans = 1;
  rep(i,n-rank) ans *= 2;
  cout<<ans<<endl;
  return 0;
}