#include <bits/stdc++.h>
using namespace std;
int a[200100], n, m, Q, rev[200100 << 2];
inline long long read() {
  char ch = getchar();
  long long x = 0;
  for (; ch > '9' || ch < '0'; ch = getchar())
    ;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
  return x;
}
struct node {
  int g[2][7];
  void init(int x) {
    for (int i = 0; i < m; i++) g[1][i] = g[0][i] = i + 1;
    g[0][m] = m, g[1][m] = 0;
    if (x) g[0][m] = 0, g[1][m] = m;
  }
  void rev() {
    for (int i = 0; i <= m; i++) swap(g[0][i], g[1][i]);
  }
} T[200100 << 2];
node merge(node a, node b) {
  node res;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j <= m; j++) res.g[i][j] = a.g[i][b.g[i][j]];
  return res;
}
void build(int t, int l, int r) {
  if (l == r) {
    T[t].init(a[l]);
    return;
  }
  int mid = l + r >> 1;
  build(t << 1, l, mid);
  build(t << 1 | 1, mid + 1, r);
  T[t] = merge(T[t << 1], T[t << 1 | 1]);
}
void change(int t, int l, int r, int L, int R) {
  if (L <= l && r <= R) {
    rev[t] ^= 1;
    T[t].rev();
    return;
  }
  int mid = l + r >> 1;
  if (L <= mid) change(t << 1, l, mid, L, R);
  if (R > mid) change(t << 1 | 1, mid + 1, r, L, R);
  T[t] = merge(T[t << 1], T[t << 1 | 1]);
  if (rev[t]) T[t].rev();
}
node query(int t, int l, int r, int L, int R) {
  if (L <= l && r <= R) return T[t];
  node res;
  int mid = l + r >> 1;
  if (R <= mid)
    res = query(t << 1, l, mid, L, R);
  else if (L > mid)
    res = query(t << 1 | 1, mid + 1, r, L, R);
  else
    res = merge(query(t << 1, l, mid, L, mid),
                query(t << 1 | 1, mid + 1, r, mid + 1, R));
  if (rev[t]) res.rev();
  return res;
}
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 op = read(), l = read(), r = read();
    if (op == 1) {
      long long x = read();
      if (x & 1) change(1, 1, n, l, r);
    } else {
      if (query(1, 1, n, l, r).g[0][m])
        puts("1");
      else
        puts("2");
    }
  }
  return 0;
}
