#include <bits/stdc++.h>
using namespace std;
struct node {
  int f[6], g[6];
  int rev;
  node() { memset(f, 0, sizeof(f)), memset(g, 0, sizeof(g)), rev = 0; }
} tree[800010];
int a[800010];
int n, m, q;
long long read() {
  long long ans = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9')
    ans = (ans << 1) + (ans << 3) + ch - '0', ch = getchar();
  return ans;
}
void pushdown(int rex) {
  if (tree[rex].rev) {
    swap(tree[rex + rex].f, tree[rex + rex].g);
    swap(tree[rex + rex + 1].f, tree[rex + rex + 1].g);
    tree[rex + rex].rev ^= tree[rex].rev;
    tree[rex + rex + 1].rev ^= tree[rex].rev;
    tree[rex].rev = 0;
  }
}
node merge(node x, node y) {
  node rex;
  for (int i = 0; i <= m; i++) rex.f[i] = x.f[y.f[i]];
  for (int i = 0; i <= m; i++) rex.g[i] = x.g[y.g[i]];
  return rex;
}
void build(int rex, int l, int r) {
  if (l == r) {
    tree[rex].f[0] = m * a[l];
    tree[rex].g[0] = m * (!a[l]);
    for (int i = 1; i <= m; i++) tree[rex].f[i] = tree[rex].g[i] = i - 1;
    return;
  }
  int mid = (l + r) >> 1;
  build(rex + rex, l, mid);
  build(rex + rex + 1, mid + 1, r);
  tree[rex] = merge(tree[rex + rex], tree[rex + rex + 1]);
}
void change(int rex, int l, int r, int x, int y) {
  if (l == x && r == y) {
    swap(tree[rex].f, tree[rex].g);
    tree[rex].rev ^= 1;
    return;
  }
  pushdown(rex);
  int mid = (l + r) >> 1;
  if (y <= mid)
    change(rex + rex, l, mid, x, y);
  else if (x > mid)
    change(rex + rex + 1, mid + 1, r, x, y);
  else
    change(rex + rex, l, mid, x, mid),
        change(rex + rex + 1, mid + 1, r, mid + 1, y);
  tree[rex] = merge(tree[rex + rex], tree[rex + rex + 1]);
}
node query(int rex, int l, int r, int x, int y) {
  if (l == x && r == y) return tree[rex];
  pushdown(rex);
  int mid = (l + r) >> 1;
  if (y <= mid)
    return query(rex + rex, l, mid, x, y);
  else if (x > mid)
    return query(rex + rex + 1, mid + 1, r, x, y);
  else
    return merge(query(rex + rex, l, mid, x, mid),
                 query(rex + rex + 1, mid + 1, r, mid + 1, y));
}
int main() {
  n = read(), m = read(), q = read();
  for (int i = 1; i <= n; i++) a[i] = read() & 1;
  build(1, 1, n);
  while (q--) {
    int cas = read(), l = read(), r = read(), d;
    if (cas == 1) {
      d = read();
      if (d & 1) change(1, 1, n, l, r);
    } else
      printf("%d\n", query(1, 1, n, l, r).f[0] == m ? 2 : 1);
  }
}
