#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
struct Node {
  long long sum = 0;
  Node *l = nullptr, *r = nullptr;
  bool rev[19];
  Node() {
    for (long long i = 0; i < 19; i++) rev[i] = false;
  }
};
vector<long long> a;
Node *build(long long l, long long r) {
  Node *it = new Node();
  if (l + 1 == r) {
    it->sum = a[l];
    return it;
  }
  long long m = (l + r) / 2;
  it->l = build(l, m);
  it->r = build(m, r);
  it->sum = (it->l->sum) + (it->r->sum);
  return it;
}
Node *upd(long long l, long long r, long long x, long long k, Node *it,
          long long d) {
  if (r <= x || x < l) return it;
  if (l + 1 == r) {
    it->sum = k;
    return it;
  }
  if ((it->rev)[d]) {
    swap(it->l, it->r);
    (it->rev)[d] = false;
    if (d) (it->rev)[d - 1] ^= 1;
  }
  for (long long i = 0; i < d; i++) {
    (it->l->rev)[i] ^= (it->rev)[i];
    (it->r->rev)[i] ^= (it->rev)[i];
    (it->rev)[i] = false;
  }
  long long m = (l + r) / 2;
  it->l = upd(l, m, x, k, it->l, d - 1);
  it->r = upd(m, r, x, k, it->r, d - 1);
  it->sum = (it->l->sum) + (it->r->sum);
  return it;
}
long long get(long long l, long long r, long long x, long long y, Node *it,
              long long d) {
  if (r <= x || y <= l) return 0;
  if (x <= l && r <= y) return it->sum;
  if ((it->rev)[d]) {
    swap(it->l, it->r);
    (it->rev)[d] = false;
    if (d) (it->rev)[d - 1] ^= 1;
  }
  for (long long i = 0; i < d; i++) {
    (it->l->rev)[i] ^= (it->rev)[i];
    (it->r->rev)[i] ^= (it->rev)[i];
    (it->rev)[i] = false;
  }
  long long m = (l + r) / 2;
  return get(l, m, x, y, it->l, d - 1) + get(m, r, x, y, it->r, d - 1);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, q;
  cin >> n >> q;
  a.resize(1 << n);
  for (long long i = 0; i < (1 << n); i++) cin >> a[i];
  Node *it = build(0, (1 << n));
  for (long long i = 0; i < q; i++) {
    long long t;
    cin >> t;
    if (t == 1) {
      long long x, k;
      cin >> x >> k;
      x--;
      it = upd(0, (1 << n), x, k, it, n);
    }
    if (t == 2) {
      long long k;
      cin >> k;
      (it->rev)[k] ^= 1;
    }
    if (t == 3) {
      long long k;
      cin >> k;
      if (k != n) {
        (it->rev)[k] ^= 1;
        (it->rev)[k + 1] ^= 1;
      }
    }
    if (t == 4) {
      long long l, r;
      cin >> l >> r;
      l--;
      cout << get(0, (1 << n), l, r, it, n) << '\n';
    }
  }
  return 0;
}
