#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
namespace ywy {
inline long long get() {
  long long n = 0;
  char c;
  while ((c = getchar()) || 23333) {
    if (c >= '0' && c <= '9') break;
    if (c == '-') goto s;
  }
  n = c - '0';
  while ((c = getchar()) || 23333) {
    if (c >= '0' && c <= '9')
      n = n * 10 + c - '0';
    else
      return (n);
  }
s:
  while ((c = getchar()) || 23333) {
    if (c >= '0' && c <= '9')
      n = n * 10 - c + '0';
    else
      return (n);
  }
}
int m;
typedef struct _n {
  int f[33];
  _n() { memset(f, 0, sizeof(f)); }
  friend _n operator*(const _n &a, const _n &b) {
    _n c;
    for (register int i = 0; i < (1 << m); i++) c.f[i] = b.f[a.f[i]];
    return (c);
  }
} node;
node data[1000001], fan[1000001];
long long ints[200001];
unsigned char bj[1000001];
node dk0, dk1;
inline void up(int tree) {
  data[tree] = data[((tree << 1) | 1)] * data[(tree << 1)];
  fan[tree] = fan[((tree << 1) | 1)] * fan[(tree << 1)];
}
inline void down(int tree) {
  if (!bj[tree]) return;
  bj[tree] = 0;
  bj[(tree << 1)] ^= 1;
  bj[((tree << 1) | 1)] ^= 1;
  swap(data[(tree << 1)], fan[(tree << 1)]);
  swap(data[((tree << 1) | 1)], fan[((tree << 1) | 1)]);
}
void build(int l, int r, int tree) {
  if (l == r) {
    if (ints[l] & 1)
      data[tree] = dk1, fan[tree] = dk0;
    else
      data[tree] = dk0, fan[tree] = dk1;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, (tree << 1));
  build(mid + 1, r, ((tree << 1) | 1));
  up(tree);
}
void fz(int rl, int rr, int l, int r, int tree) {
  if (rl == l && rr == r) {
    swap(fan[tree], data[tree]);
    bj[tree] ^= 1;
    return;
  }
  int mid = (l + r) >> 1;
  down(tree);
  if (rl > mid)
    fz(rl, rr, mid + 1, r, ((tree << 1) | 1));
  else {
    if (rr <= mid)
      fz(rl, rr, l, mid, (tree << 1));
    else {
      fz(rl, mid, l, mid, (tree << 1));
      fz(mid + 1, rr, mid + 1, r, ((tree << 1) | 1));
    }
  }
  up(tree);
}
node query(int rl, int rr, int l, int r, int tree) {
  if (rl == l && rr == r) return (data[tree]);
  int mid = (l + r) >> 1;
  down(tree);
  if (rl > mid) return (query(rl, rr, mid + 1, r, ((tree << 1) | 1)));
  if (rr <= mid) return (query(rl, rr, l, mid, (tree << 1)));
  return (query(mid + 1, rr, mid + 1, r, ((tree << 1) | 1)) *
          query(rl, mid, l, mid, (tree << 1)));
}
void ywymain() {
  int n = get();
  m = get();
  int q = get();
  for (register int i = 0; i < (1 << m); i++) {
    dk0.f[i] = (i >> 1) | (1 << (m - 1));
    if (i == (1 << m) - 1)
      dk1.f[i] = i >> 1;
    else
      dk1.f[i] = (i >> 1) | (1 << (m - 1));
  }
  for (register int i = 1; i <= n; i++) ints[i] = get();
  build(1, n, 1);
  while (q) {
    q--;
    int op = get();
    if (op == 1) {
      int l = get(), r = get();
      long long d = get();
      if (!(d & 1)) continue;
      fz(l, r, 1, n, 1);
    }
    if (op == 2) {
      int l = get(), r = get();
      node cjr = query(l, r, 1, n, 1);
      if (cjr.f[(1 << m) - 1] & (1 << (m - 1)))
        printf("1\n");
      else
        printf("2\n");
    }
  }
}
}  // namespace ywy
int main() {
  ywy::ywymain();
  return (0);
}
