#include <bits/stdc++.h>
using namespace std;
int i, j, m, n, p, k, q;
long long a[300005];
struct Tre {
  int paste[5 + 1], pre[5 + 1];
  int rev;
} tree[300005 * 4];
void up(Tre& a, Tre b, Tre c) {
  int i;
  for (i = 0; i <= m; ++i)
    a.paste[i] = b.paste[c.paste[i]], a.pre[i] = b.pre[c.pre[i]];
}
void Rev(Tre& a) {
  int i;
  for (i = 0; i <= m; ++i) swap(a.paste[i], a.pre[i]);
  a.rev ^= 1;
}
void build_tree(int l, int r, int t) {
  if (l == r) {
    int i;
    if (a[l] & 1) {
      for (i = 0; i < m; ++i) tree[t].paste[i] = i + 1;
      tree[t].paste[m] = 0;
      for (i = 0; i <= m; ++i) tree[t].pre[i] = min(m, i + 1);
    } else {
      for (i = 0; i < m; ++i) tree[t].pre[i] = i + 1;
      tree[t].pre[m] = 0;
      for (i = 0; i <= m; ++i) tree[t].paste[i] = min(m, i + 1);
    }
  } else {
    build_tree(l, ((l + r) >> 1), (t << 1));
    build_tree(((l + r) >> 1) + 1, r, ((t << 1) | 1));
    up(tree[t], tree[(t << 1)], tree[((t << 1) | 1)]);
  }
}
void down(int t) {
  if (!tree[t].rev) return;
  Rev(tree[(t << 1)]);
  Rev(tree[((t << 1) | 1)]);
  tree[t].rev = 0;
}
void modify(int ll, int rr, int l, int r, int t) {
  if (ll <= l && r <= rr)
    Rev(tree[t]);
  else {
    down(t);
    if (ll <= ((l + r) >> 1)) modify(ll, rr, l, ((l + r) >> 1), (t << 1));
    if (rr > ((l + r) >> 1))
      modify(ll, rr, ((l + r) >> 1) + 1, r, ((t << 1) | 1));
    up(tree[t], tree[(t << 1)], tree[((t << 1) | 1)]);
  }
}
int ans;
void ask(int ll, int rr, int l, int r, int t) {
  if (ll <= l && r <= rr)
    ans = tree[t].paste[ans];
  else {
    down(t);
    if (rr > ((l + r) >> 1)) ask(ll, rr, ((l + r) >> 1) + 1, r, ((t << 1) | 1));
    if (ll <= ((l + r) >> 1)) ask(ll, rr, l, ((l + r) >> 1), (t << 1));
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (i = 1; i <= n; ++i) scanf("%I64d", &a[i]);
  build_tree(1, n, 1);
  for (; q--;) {
    int ty = 0, l, r;
    long long x;
    scanf("%d", &ty);
    if (ty == 1) {
      scanf("%d%d%I64d", &l, &r, &x);
      if (x & 1) modify(l, r, 1, n, 1);
    } else {
      scanf("%d%d", &l, &r);
      ans = m;
      ask(l, r, 1, n, 1);
      if (ans > 0)
        puts("1");
      else
        puts("2");
    }
  }
}
