#include <bits/stdc++.h>
using namespace std;
template <typename A>
void _do(A x) {
  cerr << x << "\n";
}
template <typename A, typename... B>
void _do(A x, B... y) {
  cerr << x << ", ";
  _do(y...);
}
long long N, n, q;
long long seg[1200005], arr[300005];
long long rev[20], swp[20];
void build(long long l, long long r, long long idx) {
  if (l == r) {
    seg[idx] = arr[l];
    return;
  }
  long long m = (l + r) / 2;
  build(l, m, idx * 2);
  build(m + 1, r, idx * 2 + 1);
  seg[idx] = seg[idx * 2] + seg[idx * 2 + 1];
}
void modify(long long l, long long r, long long idx, long long dep,
            long long re, long long pos, long long val) {
  if (l == r) {
    assert(dep == 0);
    seg[idx] = val;
    return;
  }
  long long m = (l + r) / 2;
  re ^= rev[dep];
  long long cp = re ^ swp[dep];
  if (cp) {
    if (pos <= m)
      pos += 1 << (dep - 1);
    else
      pos -= 1 << (dep - 1);
  }
  if (pos <= m)
    modify(l, m, idx * 2, dep - 1, re, pos, val);
  else
    modify(m + 1, r, idx * 2 + 1, dep - 1, re, pos, val);
  seg[idx] = seg[idx * 2] + seg[idx * 2 + 1];
}
long long query(long long l, long long r, long long idx, long long dep,
                long long re, long long ql, long long qr) {
  if (ql <= l && r <= qr) return seg[idx];
  long long m = (l + r) / 2;
  re ^= rev[dep];
  long long cp = re ^ swp[dep];
  if (cp) {
    if (qr <= m) {
      ql += 1 << (dep - 1);
      qr += 1 << (dep - 1);
      return query(m + 1, r, idx * 2 + 1, dep - 1, re, ql, qr);
    } else if (ql > m) {
      ql -= 1 << (dep - 1);
      qr -= 1 << (dep - 1);
      return query(l, m, idx * 2, dep - 1, re, ql, qr);
    } else {
      long long q1l = ql, q1r = m, q2l = m + 1, q2r = qr;
      q1l += 1 << (dep - 1);
      q1r += 1 << (dep - 1);
      q2l -= 1 << (dep - 1);
      q2r -= 1 << (dep - 1);
      return query(m + 1, r, idx * 2 + 1, dep - 1, re, q1l, q1r) +
             query(l, m, idx * 2, dep - 1, re, q2l, q2r);
    }
  } else {
    if (qr <= m) return query(l, m, idx * 2, dep - 1, re, ql, qr);
    if (ql > m) return query(m + 1, r, idx * 2 + 1, dep - 1, re, ql, qr);
    return query(l, m, idx * 2, dep - 1, re, ql, qr) +
           query(m + 1, r, idx * 2 + 1, dep - 1, re, ql, qr);
  }
}
signed main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> q;
  N = 1 << n;
  for (long long i = 1; i <= N; i++) cin >> arr[i];
  build(1, N, 1);
  for (long long i = 1, ope, a, b; i <= q; i++) {
    cin >> ope;
    if (ope == 1) {
      cin >> a >> b;
      arr[a] = b;
      modify(1, N, 1, n, 0, a, b);
    } else if (ope == 2) {
      cin >> a;
      rev[a] ^= 1;
    } else if (ope == 3) {
      cin >> a;
      swp[a + 1] ^= 1;
    } else {
      cin >> a >> b;
      cout << query(1, N, 1, n, 0, a, b) << '\n';
    }
  }
}
