#include <iostream>

using namespace std;

char a[400][400];

char x[360];

const long MOD = 1000000007;

int main(){
    int N, M, X;
    cin >> N >> M >> X;
    for(int i = 0; i < 30; i++){
        int m = 1<<i;
        if(m&X) x[i] = 1;
        else x[i] = 0;
    }
    for(int i = 0; i < N; i++){
        int A;
        cin >> A;
        for(int j = 0; j < 30; j++){
            int m = 1<<j;
            if(m&A) a[j][i] = 1;
            else a[j][i] = 0;
        }
    }
    for(int i = 0; i < M; i++){
        int t, l, r;
        cin >> t >> l >> r;
        for(int j = l-1; j <= r-1; j++){
            a[30+i][j] = 1;
        }
        if(t == 1) x[30+i] = 1;
    }
    /*
    for(int i = 0; i < M+30; i++){
        for(int j = 0; j < N; j++){
            cout << (int) a[i][j];
        }
        cout << ' ' << (int)x[i];
        cout << endl;
    }
    cout << endl;*/
    for(int i = 0; i < 30+M && i < N; i++){
        bool find = false;
        if(a[i][i] == 1) find = true;
        else{
            for(int j = i+1; j < 30+M ; j++){
                if(a[j][i] == 1){
                    find = true;
                    for(int k = 0; k < N; k++) swap(a[i][k], a[j][k]);
                    swap(x[i], x[j]);
                }
            }
        }
        if(find){
            for(int j = 0; j < 30+M; j++){
                if(i != j && a[j][i] == 1){
                    for(int k = 0; k < N; k++){
                        a[j][k] ^= a[i][k];
                    }
                    x[j] ^= x[i];
                }
            }
        }
    }
    /*
    for(int i = 0; i < M+30; i++){
        for(int j = 0; j < N; j++){
            cout << (int) a[i][j];
        }
        cout << ' ' << (int)x[i];
        cout << endl;
    }*/
    long ans = 1;

    for(int i = 0; i < 30+M ; i++){
        int cnt = 0;
        for(int j = 0; j < N; j++){
            if(a[i][j] == 1) cnt++;
        }
        if(cnt == 0 && x[i] == 1){
            cout << 0 << endl;
            return 0;
        }
        if(cnt == 0 && x[i] == 0 && i < min(N, 30+M)){
            ans *= 2;
            ans %= MOD;
        }
    }
    
    cout << ans << endl;
}