#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
bool a[N];
int n, m, q;
struct node {
  int dp[2][7];
  int len = 0;
  bool lazy = 0;
  node() { memset(dp, -1, sizeof dp); }
};
node seg[N << 2];
void apply(int v) {
  swap(seg[v].dp[0], seg[v].dp[1]);
  seg[v].lazy ^= 1;
}
void push(int v) {
  if (!seg[v].lazy) {
    return;
  }
  apply(v + v);
  apply(v + v + 1);
  seg[v].lazy = 0;
}
node unite(node u, node v) {
  node res;
  res.len = u.len + v.len;
  if (u.dp[0][0] == -1) {
    return v;
  }
  if (v.dp[0][0] == -1) {
    return u;
  }
  for (int t = 0; t < 2; t++) {
    for (int i = 0; i < 6; i++) {
      assert(~v.dp[t][i]);
      int nxt = v.dp[t][i];
      if ((i == 0 ? 6 : i) + v.len <= m) {
        nxt = min((nxt == 0 ? 6 : nxt), i + v.len);
      }
      nxt = nxt > m ? 0 : nxt;
      res.dp[t][i] = u.dp[t][nxt];
    }
  }
  return res;
}
void build_tree(int v = 1, int tl = 0, int tr = n) {
  if (tr - tl == 1) {
    seg[v].len = tr - tl;
    for (int t = 0; t < 2; t++) {
      for (int i = 0; i < 6; i++) {
        if (i == 0) {
          seg[v].dp[t][i] = a[tl] ^ t;
        } else {
          seg[v].dp[t][i] = (i > m) & (a[tl] ^ t) ? 1 : i + 1;
        }
      }
    }
    return;
  }
  int tm = (tl + tr) >> 1;
  build_tree(v + v, tl, tm);
  build_tree(v + v + 1, tm, tr);
  seg[v] = unite(seg[v + v], seg[v + v + 1]);
}
void modify(int l, int r, int v = 1, int tl = 0, int tr = n) {
  if (r <= tl || tr <= l) {
    return;
  }
  if (l <= tl && tr <= r) {
    return apply(v);
  }
  int tm = (tl + tr) >> 1;
  push(v);
  modify(l, r, v + v, tl, tm);
  modify(l, r, v + v + 1, tm, tr);
  seg[v] = unite(seg[v + v], seg[v + v + 1]);
}
node get(int l, int r, int v = 1, int tl = 0, int tr = n) {
  if (r <= tl || tr <= l) {
    return node();
  }
  if (l <= tl && tr <= r) {
    return seg[v];
  }
  int tm = (tl + tr) >> 1;
  push(v);
  return unite(get(l, r, v + v, tl, tm), get(l, r, v + v + 1, tm, tr));
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> q;
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    a[i] = x & 1;
  }
  build_tree();
  while (q-- > 0) {
    int type, l, r;
    cin >> type >> l >> r;
    --l;
    if (type == 1) {
      long long x;
      cin >> x;
      if (!(x & 1)) {
        continue;
      }
      modify(l, r);
    } else {
      int res = get(l, r).dp[0][0];
      cout << (res == 1 ? 2 : 1) << '\n';
    }
  }
  return 0;
}
