#include <bits/stdc++.h>
using namespace std;
struct func {
  int f[1 << 5];
};
func operator+(func a, func b) {
  func c;
  for (int i = 0; i < (1 << 5); i++) c.f[i] = a.f[b.f[i]];
  return c;
}
func tree[65536 * 4 * 3][2];
int tot;
int tag[65536 * 4 * 3];
int lc[65536 * 4 * 3], rc[65536 * 4 * 3];
void flip(int id) {
  tag[id] ^= 1;
  swap(tree[id][0], tree[id][1]);
}
void up(int id) {
  tree[id][0] = tree[lc[id]][0] + tree[rc[id]][0];
  tree[id][1] = tree[lc[id]][1] + tree[rc[id]][1];
}
void down(int id) {
  if (tag[id]) flip(lc[id]), flip(rc[id]);
  tag[id] = 0;
}
int sign[65536 * 4];
int n, q;
int m;
func ask(int a, int b, int l, int r, int id) {
  if (l >= a and r <= b) return tree[id][0];
  down(id);
  if (b <= (l + r) / 2) return ask(a, b, l, (l + r) / 2, lc[id]);
  if (a > (l + r) / 2) return ask(a, b, (l + r) / 2 + 1, r, rc[id]);
  return ask(a, b, l, (l + r) / 2, lc[id]) +
         ask(a, b, (l + r) / 2 + 1, r, rc[id]);
}
void flip(int a, int b, int l, int r, int id) {
  if (l >= a and r <= b) {
    flip(id);
    return;
  }
  down(id);
  if (a <= (l + r) / 2) flip(a, b, l, (l + r) / 2, lc[id]);
  if (b > (l + r) / 2) flip(a, b, (l + r) / 2 + 1, r, rc[id]);
  up(id);
}
int build(int l, int r) {
  int id = ++tot;
  if (l == r) {
    for (int i = 0; i < (1 << 5); i++) {
      int j = (i << 1);
      j &= 31;
      int flg = 1;
      for (int k = 0; k < m; k++)
        if ((1 << k) & i) flg = 0;
      if (sign[l]) {
        tree[id][0].f[i] = j | flg;
        tree[id][1].f[i] = j;
      } else {
        tree[id][0].f[i] = j;
        tree[id][1].f[i] = j | flg;
      }
    }
    return id;
  }
  lc[id] = build(l, (l + r) / 2);
  rc[id] = build((l + r) / 2 + 1, r);
  up(id);
  return id;
}
signed main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    long long d;
    scanf("%lld", &d);
    sign[i] = d & 1;
  }
  assert(1 == build(1, n));
  while (q--) {
    int t, l, r;
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1) {
      long long d;
      scanf("%lld", &d);
      if (d & 1) flip(l, r, 1, n, 1);
    } else {
      printf("%d\n", (ask(l, r, 1, n, 1).f[0] & 1) + 1);
    }
  }
  return 0;
}
