#include <bits/stdc++.h>
constexpr auto Inf = 0X3F3F3F3F;
using namespace std;
namespace IO {
inline long long read() {
  long long o = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c > '/' && c < ':') {
    o = o * 10 + c - '0';
    c = getchar();
  }
  return o * f;
}
inline char recd() {
  char o;
  while ((o = getchar()) < '0' || o > '9')
    ;
  return o;
}
inline double reod() {
  double o = read(), f = 1;
  char c;
  while ((c = getchar()) > '/' && c < ':') o += (c - '0') / (f *= 10);
  return o;
}
}  // namespace IO
using namespace IO;
const int SIZE = 2E5 + 7, Mod = 1E9 + 7;
struct Nodde {
  int L, R;
  long long S;
} Node[1 << 19 | 1];
int swp[23];
void pushup(int now) { Node[now].S = Node[now << 1].S + Node[now << 1 | 1].S; }
void BUILD(int now, int L, int R) {
  Node[now].L = L, Node[now].R = R;
  if (L == R) {
    Node[now].S = read();
    return;
  }
  int M = (L + R) >> 1;
  BUILD(now << 1, L, M), BUILD(now << 1 | 1, M + 1, R);
  pushup(now);
}
void Upd(int now, int L, int R, int pos, int w, int dep) {
  if (L == R) {
    Node[now].S = w;
    return;
  }
  int M = (L + R) >> 1;
  if (M < pos)
    Upd((now << 1 | 1) - swp[dep], M + 1, R, pos, w, dep - 1);
  else
    Upd((now << 1) + swp[dep], L, M, pos, w, dep - 1);
  pushup(now);
}
long long Ask(int now, int L, int R, int aL, int aR, int dep) {
  if (L >= aL && R <= aR) return Node[now].S;
  int M = (L + R) >> 1;
  if (M < aL)
    return Ask((now << 1 | 1) - swp[dep], M + 1, R, aL, aR, dep - 1);
  else if (M >= aR)
    return Ask((now << 1) + swp[dep], L, M, aL, aR, dep - 1);
  else
    return Ask((now << 1) + swp[dep], L, M, aL, M, dep - 1) +
           Ask((now << 1 | 1) - swp[dep], M + 1, R, M + 1, aR, dep - 1);
}
int main() {
  int N = read(), M = read();
  BUILD(1, 1, 1 << N);
  int o, L, R;
  while (M--) {
    o = read(), L = read();
    if (o == 1)
      R = read(), Upd(1, 1, 1 << N, L, R, N);
    else if (o == 2)
      for (int pos = 0; pos <= L; pos++) swp[pos] ^= 1;
    else if (o == 3)
      swp[L + 1] ^= 1;
    else
      R = read(), printf("%lld\n", Ask(1, 1, 1 << N, L, R, N));
  }
}
