#include <bits/stdc++.h>
using namespace std;
const int N = 20;
const long long mod = 1000000007;
vector<int> lazy(N, 0);
int n, m;
struct segment_tree {
  int B;
  vector<long long> sum;
  void init(int n) {
    B = 1;
    while (B < n) B *= 2;
    sum.resize(B * 2);
  }
  long long merge(long long a, long long b) { return a + b; }
  void build(int node, int l, int r, vector<long long> &a) {
    if (l == r - 1) {
      sum[node] = a[l];
      return;
    }
    int mid = (l + r) / 2;
    build(node * 2 + 1, l, mid, a);
    build(node * 2 + 2, mid, r, a);
    sum[node] = merge(sum[node * 2 + 1], sum[node * 2 + 2]);
  }
  void build(vector<long long> &a) { build(0, 0, B, a); }
  void upd(int node, int lvl, int pos, long long val) {
    if (lvl == 0) {
      sum[node] = val;
      return;
    }
    int lson = node * 2 + 1;
    int rson = node * 2 + 2;
    if (lazy[lvl]) swap(lson, rson);
    if (pos < (1 << (lvl - 1))) {
      upd(lson, lvl - 1, pos, val);
    } else {
      upd(rson, lvl - 1, pos - (1 << (lvl - 1)), val);
    }
    sum[node] = merge(sum[node * 2 + 1], sum[node * 2 + 2]);
  }
  void upd(int pos, int val) { upd(0, n, pos, val); }
  long long ask(int node, int lvl, int l, int r) {
    if (r <= 0 || l >= (1 << lvl)) {
      return 0;
    }
    if (l <= 0 && r >= (1 << lvl)) {
      return sum[node];
    }
    int lson = node * 2 + 1;
    int rson = node * 2 + 2;
    if (lazy[lvl]) {
      swap(lson, rson);
    }
    return merge(
        ask(lson, lvl - 1, l, r),
        ask(rson, lvl - 1, l - (1 << (lvl - 1)), r - (1 << (lvl - 1))));
  }
  long long ask(int l, int r) { return ask(0, n, l, r); }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  vector<long long> a(1 << n);
  for (long long &x : a) cin >> x;
  segment_tree st;
  st.init(1 << n);
  st.build(a);
  for (int i = 1; i <= m; i++) {
    int op;
    cin >> op;
    if (op == 1) {
      long long x, k;
      cin >> x >> k;
      st.upd(x - 1, k);
    } else if (op == 2) {
      long long k;
      cin >> k;
      for (int i = 0; i <= k; i++) {
        lazy[i] ^= 1;
      }
    } else if (op == 3) {
      long long k;
      cin >> k;
      lazy[k + 1] ^= 1;
    } else {
      long long l, r;
      cin >> l >> r;
      cout << st.ask(l - 1, r) << '\n';
    }
  }
  return 0;
}
