#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
const ll mod=1e9+7 ;

int main(){
	int n,m,k;
	cin>>n>>m>>k;
	assert(n<=24);
	int a[n];
	rep(i,n)cin>>a[i];
	pair<int,pair<int,int>> p[m];
	rep(i,m)cin>>p[i].first>>p[i].second.first>>p[i].second.second;
	int all=1<<n;
	int ans=0;
	rep(i,all){
		int ret=0;
		rep(j,n)if((1<<j)&i)ret^=a[j];
		if(ret!=k)continue;
		bool ok=true;
		rep(j,m){
			int cnt=0;
			REP(k,p[j].second.first-1,p[j].second.second){
				if((1<<k)&i)++cnt;
			}
			if(cnt%2!=p[j].first)ok=false;
		}
		ans+=ok;
	}
	cout<<ans<<endl;
	return 0;
}