#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
inline int sign(double x) { return (x > eps) - (x < -eps); }
const int maxn = 3e5 + 10, mod = 1e9 + 7, INF = 0x3f3f3f3f;
long long sum[maxn << 2];
int lz[30];
void build(int l, int r, int rt) {
  if (l == r) {
    scanf("%d", &sum[rt]);
    return;
  }
  int m = l + r >> 1;
  build(l, m, rt << 1);
  build(m + 1, r, rt << 1 | 1);
  sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void upd(int p, int x, int k, int l, int r, int rt) {
  if (l == r) {
    sum[rt] = x;
    return;
  }
  int m = l + r >> 1;
  int lc = rt << 1, rc = rt << 1 | 1;
  if (lz[k]) swap(lc, rc);
  if (p <= m)
    upd(p, x, k - 1, l, m, lc);
  else
    upd(p, x, k - 1, m + 1, r, rc);
  sum[rt] = sum[lc] + sum[rc];
}
long long qry(int L, int R, int k, int l, int r, int rt) {
  if (L <= l && r <= R) return sum[rt];
  int m = l + r >> 1;
  long long res = 0;
  int lc = rt << 1, rc = rt << 1 | 1;
  if (lz[k]) swap(lc, rc);
  if (L <= m) res += qry(L, R, k - 1, l, m, lc);
  if (R > m) res += qry(L, R, k - 1, m + 1, r, rc);
  return res;
}
int main() {
  int m, q;
  cin >> m >> q;
  int n = 1 << m;
  build(1, n, 1);
  while (q--) {
    int ty, x;
    scanf("%d%d", &ty, &x);
    if (ty == 1) {
      int y;
      scanf("%d", &y);
      upd(x, y, m, 1, n, 1);
    } else if (ty == 4) {
      int y;
      scanf("%d", &y);
      printf("%lld\n", qry(x, y, m, 1, n, 1));
    } else if (ty == 2) {
      for (int i = x; i >= 0; --i) lz[i] ^= 1;
    } else
      lz[x + 1] ^= 1;
  }
  return 0;
}
