#include <bits/stdc++.h>
bool isp(int x) {
  if (x < 2) return 0;
  for (int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return 0;
  }
  return 1;
}
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - 48;
    ch = getchar();
  }
  return x * f;
}
int gcd(int x, int y) { return !y ? x : gcd(y, x % y); }
using namespace std;
struct node {
  long long sz[10];
  node() { memset(sz, 0, sizeof(sz)); }
};
node operator+(node x, node y) {
  node tmp;
  for (int i = 1; i <= 9; i++) tmp.sz[i] = x.sz[y.sz[i]];
  return tmp;
}
struct segtree {
  node sum[2];
  long long lazy;
  long long lc, rc;
} tree[1000000];
long long a[200005], N, M, cnt, Q;
void push_up(long long now) {
  tree[now].sum[0] = tree[now << 1].sum[0] + tree[now << 1 | 1].sum[0];
  tree[now].sum[1] = tree[now << 1].sum[1] + tree[now << 1 | 1].sum[1];
  return;
}
void build(long long now, long long l, long long r) {
  tree[now].lc = l, tree[now].rc = r;
  if (l == r) {
    for (int i = 1; i <= M; i++) {
      tree[now].sum[a[l]].sz[i] = tree[now].sum[a[l] ^ 1].sz[i] = i + 1;
    }
    tree[now].sum[a[l]].sz[M + 1] = 1;
    tree[now].sum[a[l] ^ 1].sz[M + 1] = M + 1;
  } else {
    long long mid = (l + r) >> 1;
    build(now << 1, l, mid);
    build(now << 1 | 1, mid + 1, r);
    push_up(now);
  }
  return;
}
void push_down(long long now) {
  if (tree[now].lazy) {
    swap(tree[now << 1].sum[0], tree[now << 1].sum[1]);
    tree[now << 1].lazy ^= 1;
    swap(tree[now << 1 | 1].sum[0], tree[now << 1 | 1].sum[1]);
    tree[now << 1 | 1].lazy ^= 1;
    tree[now].lazy = 0;
    push_up(now);
  }
  return;
}
void update(long long now, long long l, long long r) {
  if (l <= tree[now].lc && r >= tree[now].rc) {
    swap(tree[now].sum[0], tree[now].sum[1]);
    tree[now].lazy ^= 1;
  } else {
    push_down(now);
    long long mid = (tree[now].lc + tree[now].rc) >> 1;
    if (r <= mid)
      update(now << 1, l, r);
    else if (l > mid)
      update(now << 1 | 1, l, r);
    else {
      update(now << 1, l, mid);
      update(now << 1 | 1, mid + 1, r);
    }
    push_up(now);
  }
  return;
}
node query(long long now, long long l, long long r) {
  if (l <= tree[now].lc && r >= tree[now].rc) {
    return tree[now].sum[0];
  }
  push_down(now);
  long long mid = (tree[now].lc + tree[now].rc) >> 1;
  if (r <= mid) return query(now << 1, l, r);
  if (l > mid) return query(now << 1 | 1, l, r);
  return query(now << 1, l, mid) + query(now << 1 | 1, mid + 1, r);
}
int main() {
  N = read(), M = read(), Q = read();
  for (long long i = 1; i <= N; i++) a[i] = (read() - 1) % 2;
  build(1, 1, N);
  for (long long i = 1; i <= Q; i++) {
    long long op = read();
    if (op == 1) {
      long long x = read(), y = read(), k = read();
      if (k & 1) update(1, x, y);
    } else {
      long long x = read(), y = read();
      cout << (((query(1, x, y).sz[M + 1]) == 1) ? 2 : 1) << endl;
    }
  }
  return 0;
}
