#include <bits/stdc++.h>
using namespace std;
long long a[300000];
long long tree[300000 * 4];
bool con[20];
int n;
void init(int idx, int l, int r) {
  if (l == r) {
    tree[idx] = a[l];
    return;
  }
  init(2 * idx, l, (l + r) / 2);
  init(2 * idx + 1, (l + r) / 2 + 1, r);
  tree[idx] = tree[2 * idx] + tree[2 * idx + 1];
}
void upd(int idx, int l, int r, int ini, long long val) {
  if (ini > r || ini < l) {
    return;
  }
  if (l == r) {
    tree[idx] = val;
    return;
  }
  upd(2 * idx, l, (l + r) / 2, ini, val);
  upd(2 * idx + 1, (l + r) / 2 + 1, r, ini, val);
  tree[idx] = tree[2 * idx] + tree[2 * idx + 1];
}
void repl(int pos, int val) {
  int bawa = pos;
  for (int i = 1; i < 20; i++) {
    int now = (1 << i);
    if (con[i]) {
      int x = (bawa - 1) / now + 1;
      int y = (x - 1) * now + 1;
      x = x * now;
      x = x + y;
      bawa = x - bawa;
    }
  }
  upd(1, 1, (1 << n), bawa, val);
}
long long cari(int idx, int l, int r, int kiri, int kanan, int now) {
  if (kiri > r || kanan < l) {
    return 0;
  }
  if (kiri < l) kiri = l;
  if (kanan > r) kanan = r;
  if (con[now]) {
    int x = r + l;
    int p = x - kiri;
    int q = x - kanan;
    kiri = q;
    kanan = p;
  }
  if (l >= kiri && r <= kanan) {
    return tree[idx];
  }
  long long a = cari(2 * idx, l, (l + r) / 2, kiri, kanan, now - 1);
  long long b = cari(2 * idx + 1, (l + r) / 2 + 1, r, kiri, kanan, now - 1);
  return a + b;
}
int main() {
  int q;
  cin >> n >> q;
  int pan = (1 << n);
  memset(con, false, sizeof(con));
  for (int i = 1; i <= pan; i++) {
    cin >> a[i];
  }
  init(1, 1, (1 << n));
  for (int i = 1; i <= q; i++) {
    int tipe;
    cin >> tipe;
    if (tipe == 1) {
      int x, k;
      cin >> x >> k;
      repl(x, k);
    } else if (tipe == 2) {
      int k;
      cin >> k;
      con[k] = !con[k];
    } else if (tipe == 3) {
      int k;
      cin >> k;
      con[k] = !con[k];
      con[k + 1] = !con[k + 1];
    } else {
      int l, r;
      cin >> l >> r;
      long long hasil = cari(1, 1, (1 << n), l, r, n);
      cout << hasil << "\n";
    }
  }
}
