#include <bits/stdc++.h>
using namespace std;
template <class T>
using v2d = vector<vector<T> >;
template <class T>
bool uin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const int BS = 190;
const int BC = 1100;
const int maxN = BS * BC + 10;
const int maxM = 5;
int n, m, q;
bool a[BC][BS], lazy[BC], f[BC][2][maxM + 1][BS], g[BS];
void build(int i) {
  for (int t = 0; t < (int)(2); ++t) {
    for (int x = (int)(0); x <= (int)(m); ++x) {
      for (int j = (int)(BS - x); j <= (int)(BS - 1); ++j) {
        f[i][t][x][j] = 1;
      }
      for (int j = BS - x - 1; j >= 0; j--) {
        bool &cur = f[i][t][x][j];
        cur = a[i][j] ^ t ^ 1;
        for (int k = (int)(j + 1); k <= (int)(min(j + m, BS - 1)); ++k) {
          cur |= !f[i][t][x][k];
        }
      }
    }
  }
}
void flip(int i, int l, int r) {
  if (lazy[i]) {
    lazy[i] = 0;
    for (int j = 0; j < (int)(BS); ++j) {
      a[i][j] ^= 1;
    }
  }
  for (int j = (int)(l); j <= (int)(r); ++j) {
    a[i][j] ^= 1;
  }
  build(i);
}
void solve() {
  cin >> n >> m >> q;
  for (int i = 0; i < (int)(BC); ++i) {
    fill(a[i], a[i] + BS, 1);
  }
  for (int i = 0; i < (int)(n); ++i) {
    long long tmp;
    cin >> tmp;
    a[i / BS][i % BS] = tmp & 1;
  }
  for (int i = 0; i < (int)(BC); ++i) {
    build(i);
  }
  while (q--) {
    int type, l, r;
    cin >> type >> l >> r;
    l--;
    r--;
    int L = l / BS;
    int R = r / BS;
    if (type == 1) {
      long long tmp;
      cin >> tmp;
      if (tmp & 1) {
        l -= L * BS;
        r -= R * BS;
        if (L == R) {
          flip(L, l, r);
          continue;
        }
        for (int i = (int)(L + 1); i <= (int)(R - 1); ++i) {
          lazy[i] ^= 1;
        }
        flip(L, l, BS - 1);
        flip(R, 0, r);
      }
    } else {
      l -= L * BS;
      r -= R * BS;
      for (int i = r; i >= 0; i--) {
        g[i] = a[R][i] ^ lazy[R] ^ 1;
        for (int j = (int)(i + 1); j <= (int)(min(i + m, r)); ++j) {
          g[i] |= !g[j];
        }
      }
      if (L == R) {
        cout << (int)!g[l] + 1 << "\n";
        continue;
      }
      int x = 0;
      for (int i = (int)(0); i <= (int)(min(m - 1, r)); ++i) {
        if (!g[i]) {
          x = m - i;
          break;
        }
      }
      for (int i = R - 1; i >= L + 1; i--) {
        int tx = 0;
        for (int j = 0; j < (int)(m); ++j) {
          if (!f[i][lazy[i]][x][j]) {
            tx = m - j;
            break;
          }
        }
        x = tx;
      }
      cout << (int)!f[L][lazy[L]][x][l] + 1 << "\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
