#include using namespace std; //#define DEBUG_MODE #define endl '\n' #ifdef DEBUG_MODE #define DEBUG(X) debug_func(X, #X) #define DEBUG_ENDL endl << flush #define DEBUG_SEPARATOR_LINE cout<<"=================\n" #else #define DEBUG(X) 0 #define DEBUG_ENDL 0 #define DEBUG_SEPARATOR_LINE 0 #endif #define ALL(V) (V).begin(), (V).end() #define ALLR(V) (V).rbegin(), (V).rend() #define DEBUG_ENDL_S(S) ((S).size() ? "\n" : "") << flush; template using V = vector; template using VV = V>; template using P = pair; using ll = int64_t; using PLL = P; template const T& var_min(const T &t) { return t; } template const T& var_max(const T &t) { return t; } template const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); } template const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); } template void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } void debug_func_preffix(const string &s) { if(s.size()) cout << s << " = "; } template void debug_func(const T &t, const string &s = "") { debug_func_preffix(s); cout << t << DEBUG_ENDL_S(s); } template void debug_func(const P &p, const string &s = "") { debug_func_preffix(s); cout << "("; debug_func(p.first); cout << ", "; debug_func(p.second); cout << ")" << DEBUG_ENDL_S(s); } template void debug_func(const V &v, const string &s = "") { for(ll i = 0; i < v.size(); i++) { string t = s + "[" + to_string(i) + "]"; debug_func(v[i], t); } } void init_io() { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(30); } using BS = bitset<512>; using Matrix = V; const ll MOD = 1e9 + 7; tuple gauss_elim(Matrix mat, BS b, ll dim) { ll fcnt = 0; for(ll col = 0; col < dim; col++) { ll row = -1; for(ll r = col; r < mat.size(); r++) { if(mat[r].test(col)) { row = r; break; } } if(row == -1) { fcnt++; continue; } if(row != col) { swap(mat[col], mat[row]); bool tmp = b[col]; b.set(col, b[row]); b.set(row, tmp); } for(ll r = 0; r < mat.size(); r++) { if(r == col) continue; if(!mat[r].test(col)) continue; mat[r] ^= mat[col]; bool tmp = b[r] ^ b[col]; b.set(r, tmp); } } return make_tuple(mat, b, fcnt); } ll calc(Matrix mat, BS b, ll dim) { auto tmp = gauss_elim(mat, b, dim); Matrix gmat; BS gb; ll fcnt; tie(gmat, gb, fcnt) = tmp; #ifdef DEBUG_MODE for(ll i = 0; i < gmat.size(); i++) cout << gmat[i].to_string() << " = " << (gb[i] ? 1 : 0) << endl; #endif for(ll i = 0; i < gmat.size(); i++) if(!gmat[i].any() && gb.test(i)) return 0; ll ret = 1; for(ll i = 0; i < fcnt; i++) (ret *= 2) %= MOD; return ret; } int main() { init_io(); ll N, M, X; cin >> N >> M >> X; BS b(X); Matrix mat(60 + M, BS(0)); ll dim = N; for(ll i = 0; i < N; i++) { ll A; cin >> A; BS ab(A); for(ll dig = 0; dig < 60; dig++) mat[dig][i] = ab.test(dig); } for(ll i = 0; i < M; i++) { ll type, l, r; cin >> type >> l >> r; l--; r--; for(ll j = l; j <= r; j++) mat[i + 60].set(j); b.set(i + 60, !!(type)); } #ifdef DEBUG_MODE for(ll i = 0; i < mat.size(); i++) cout << mat[i].to_string() << " = " << (b[i] ? 1 : 0) << endl; #endif cout << calc(mat, b, dim) << endl; return 0; }