#include <bits/stdc++.h>
#pragma GCC optmize(3)
using namespace std;
const int N = 2.5e5 + 5;
#define For(i, l, r) for (int i = (l); i <= (r); i++)
int t, n, q, a[N];
namespace Sub1{
void main(){
  For(_, 1, q) {
    int op, x, y;
    cin >> op >> x;
    if (op == 1) {
      cin >> y;
      for (int i = y; i > x; i--)
        a[i] ^= a[i - 1];
    } else
      cout << a[x] << '\n';
  }
}
}
namespace Sub23{
bitset<N> f, g;
void main2() {
  f[1] = 1;
  For(_, 1, q) {
    int op, x, y;
    cin >> op >> x, g.set();
    if (op == 1) {
      cin >> y;
      g >>= x;
      g <<= (N - y + x);
      g >>= (N - y);
      g &= f, g <<= 1, f ^= g;
    } else
      cout << (f[x] ? a[1] : 0) << '\n';
  }
  For(i, 1, n) a[i] = (f[i] ? a[1] : 0);
}
void main3() {
  For(i, 1, n) f[i] = a[i];
  For(_, 1, q) {
    int op, x, y;
    cin >> op >> x, g.set();
    if (op == 1) {
      cin >> y;
      g >>= x;
      g <<= (N - y + x);
      g >>= (N - y);
      g &= f, g <<= 1, f ^= g;
    } else
      cout << f[x] << '\n';
  }
  For(i, 1, n) a[i] = f[i];
}  
}
namespace Sub4{
int b[N], id[N], p[N];
void main() {
  int k = 0, c = 0;
  For(i, 1, n) if (a[i]) p[++c] = i;
  For(_, 1, q) {
    int op, x, y;
    cin >> op >> x;
    if (op == 1)
      cin >> y, ++k;
    if (op == 2) {
      int ans = 0;
      For(i, 1, c) {
        int pos = p[i];
        if ((k & (x - pos)) == (x - pos))
          ans ^= a[pos];
      }
      cout << ans << '\n';
    }
  }
  For(i, 1, n) {
    int ans = 0;
    For(j, 1, c) {
      int pos = p[j];
      if ((k & (i - pos)) == (i - pos))
        ans ^= a[pos];
    }
    b[i] = ans;
  }
  For(i, 1, n) a[i] = b[i];
}  
}
namespace Sub5{
int f[22][N];
void main() {
  For(_, 1, q){
    int op, x, y;
    cin >> op >> x >> y;
  }
  int k = q, d = __lg(k) + 1;
  For(i, 1, n) f[0][i] = a[i];
  For(i, 1, d) For(j, 1, n){
    f[i][j] = f[i-1][j]; 
    int dig = (1 << i - 1);
    if(k & dig) if(j >= dig) f[i][j] ^= f[i-1][j - dig];
  }
  For(i, 1, n) a[i] = f[d][i];
}  
}

signed main() {
  freopen("xor.in", "r", stdin);
  freopen("xor.out", "w", stdout);
  cin.tie(0)->ios::sync_with_stdio(0);
  cin >> t >> n >> q;
  For(i, 1, n) cin >> a[i];
  if (t == 1 || t > 5) Sub1::main();
  if (t == 2) Sub23::main2();
  if (t == 3) Sub23::main3();
  if (t == 4) Sub4::main();
  if (t == 5) Sub5::main();
  For(i, 1, n) cout << a[i] << '\n';
  return 0;
}