#include <bits/stdc++.h>
using namespace std;
int arr[270000];
int rev[20];
void reverse(int k) {
  for (int i = k; i >= 0; i--) rev[i] ^= 1;
}
struct node {
  node *lch, *rch;
  long long sum;
  int tag;
  node(int val = 0) {
    lch = rch = nullptr;
    sum = val;
    tag = 0;
  }
  void build(int l, int r) {
    if (l == r) {
      sum = arr[l];
    } else {
      int mid = (l + r) >> 1;
      lch = new node();
      lch->build(l, mid);
      rch = new node();
      rch->build(mid + 1, r);
      sum = lch->sum + rch->sum;
    }
  }
  void push(int k) {
    if (rev[k] ^ tag == 1) {
      swap(lch, rch);
      tag ^= 1;
    }
  }
  void modify(int l, int r, int pos, int new_val, int k) {
    if (l == r)
      sum = new_val;
    else {
      int mid = (l + r) >> 1;
      push(k);
      if (pos <= mid)
        lch->modify(l, mid, pos, new_val, k - 1);
      else
        rch->modify(mid + 1, r, pos, new_val, k - 1);
      sum = lch->sum + rch->sum;
    }
  }
  long long query(int l, int r, int ql, int qr, int k) {
    if (l == ql && r == qr)
      return sum;
    else {
      int mid = (l + r) >> 1;
      push(k);
      if (qr <= mid)
        return lch->query(l, mid, ql, qr, k - 1);
      else if (ql > mid)
        return rch->query(mid + 1, r, ql, qr, k - 1);
      else
        return lch->query(l, mid, ql, mid, k - 1) +
               rch->query(mid + 1, r, mid + 1, qr, k - 1);
    }
  }
};
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  int m = (1 << n);
  for (int i = 1; i <= m; i++) cin >> arr[i];
  node *root = new node();
  root->build(1, m);
  while (q--) {
    int type;
    cin >> type;
    if (type == 1) {
      int x, k;
      cin >> x >> k;
      root->modify(1, m, x, k, n);
    } else if (type == 2) {
      int k;
      cin >> k;
      reverse(k);
    } else if (type == 3) {
      int k;
      cin >> k;
      reverse(k + 1);
      reverse(k);
    } else {
      int l, r;
      cin >> l >> r;
      cout << root->query(1, m, l, r, n) << '\n';
    }
  }
  return 0;
}
