#include <bits/stdc++.h>
using namespace std;
template <class T = int>
inline T readInt();
inline double readDouble();
inline int readUInt();
inline int readChar();
inline void readWord(char *s);
inline bool readLine(char *s);
inline bool isEof();
inline int getChar();
inline int peekChar();
inline bool seekEof();
inline void skipBlanks();
template <class T>
inline void writeInt(T x, char end = 0, int len = -1);
inline void writeChar(int x);
inline void writeWord(const char *s);
inline void writeDouble(double x, int len = 0);
inline void flush();
static struct buffer_flusher_t {
  ~buffer_flusher_t() { flush(); }
} buffer_flusher;
static const int buf_size = 4096;
static unsigned char buf[buf_size];
static int buf_len = 0, buf_pos = 0;
inline bool isEof() {
  if (buf_pos == buf_len) {
    buf_pos = 0, buf_len = fread(buf, 1, buf_size, stdin);
    if (buf_pos == buf_len) return 1;
  }
  return 0;
}
inline int getChar() { return isEof() ? -1 : buf[buf_pos++]; }
inline int peekChar() { return isEof() ? -1 : buf[buf_pos]; }
inline bool seekEof() {
  int c;
  while ((c = peekChar()) != -1 && c <= 32) buf_pos++;
  return c == -1;
}
inline void skipBlanks() {
  while (!isEof() && buf[buf_pos] <= 32U) buf_pos++;
}
inline int readChar() {
  int c = getChar();
  while (c != -1 && c <= 32) c = getChar();
  return c;
}
inline int readUInt() {
  int c = readChar(), x = 0;
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return x;
}
template <class T>
inline T readInt() {
  int s = 1, c = readChar();
  T x = 0;
  if (c == '-')
    s = -1, c = getChar();
  else if (c == '+')
    c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return s == 1 ? x : -x;
}
inline double readDouble() {
  int s = 1, c = readChar();
  double x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  if (c == '.') {
    c = getChar();
    double coef = 1;
    while ('0' <= c && c <= '9') x += (c - '0') * (coef *= 1e-1), c = getChar();
  }
  return s == 1 ? x : -x;
}
inline void readWord(char *s) {
  int c = readChar();
  while (c > 32) *s++ = c, c = getChar();
  *s = 0;
}
inline bool readLine(char *s) {
  int c = getChar();
  while (c != '\n' && c != -1) *s++ = c, c = getChar();
  *s = 0;
  return c != -1;
}
static int write_buf_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
  if (write_buf_pos == buf_size)
    fwrite(write_buf, 1, buf_size, stdout), write_buf_pos = 0;
  write_buf[write_buf_pos++] = x;
}
inline void flush() {
  if (write_buf_pos) {
    fwrite(write_buf, 1, write_buf_pos, stdout), write_buf_pos = 0;
    fflush(stdout);
  }
}
template <class T>
inline void writeInt(T x, char end, int output_len) {
  if (x < 0) writeChar('-'), x = -x;
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = '0' + x % 10, x /= 10;
  while (n < output_len) s[n++] = '0';
  while (n--) writeChar(s[n]);
  if (end) writeChar(end);
}
inline void writeWord(const char *s) {
  while (*s) writeChar(*s++);
}
inline void writeDouble(double x, int output_len) {
  if (x < 0) writeChar('-'), x = -x;
  assert(x <= (1LLU << 63) - 1);
  long long t = (long long)x;
  writeInt(t), x -= t;
  writeChar('.');
  for (int i = output_len - 1; i > 0; i--) {
    x *= 10;
    t = std::min(9, (int)x);
    writeChar('0' + t), x -= t;
  }
  x *= 10;
  t = std::min(9, (int)(x + 0.5));
  writeChar('0' + t);
}
mt19937 rnd(time(0));
const int N = (1 << 18), INF = 1e9 + 10;
long long a[N];
int n, q;
struct Node {
  long long sum;
  Node *left, *right;
  int rev, swp;
  Node(long long x) {
    this->sum = x;
    left = right = nullptr;
    rev = swp = 0;
  }
};
Node *root;
Node *build(int l, int r) {
  Node *root = new Node(0);
  if (r == l + 1) {
    root->sum = a[l];
    return root;
  }
  int m = (r + l) / 2;
  root->left = build(l, m);
  root->right = build(m, r);
  root->sum = root->left->sum + root->right->sum;
  return root;
}
void reverse(int k) { root->rev ^= (1 << (n - k)); }
void swap(int k) { root->swp ^= (1 << (n - k)); }
void push(Node *root, int l, int r) {
  if (root == nullptr) {
    return;
  }
  if (r == l + 1) {
    return;
  }
  if ((root->swp >> 1) & 1) {
    swap(root->left, root->right);
    root->swp ^= 2;
  }
  if (root->rev & 1) {
    swap(root->left, root->right);
    root->rev ^= 1;
    root->rev ^= 2;
  }
  root->left->rev ^= (root->rev >> 1);
  root->left->swp ^= (root->swp >> 1);
  root->right->rev ^= (root->rev >> 1);
  root->right->swp ^= (root->swp >> 1);
  root->swp = root->rev = 0;
}
void change(Node *root, int l, int r, int ind, int x) {
  push(root, l, r);
  if (r == l + 1) {
    root->sum = x;
    return;
  }
  int m = (r + l) / 2;
  if (ind < m) {
    change(root->left, l, m, ind, x);
  } else {
    change(root->right, m, r, ind, x);
  }
  root->sum = root->left->sum + root->right->sum;
}
long long getsum(Node *root, int L, int R, int l, int r) {
  push(root, l, r);
  if (l >= R || r <= L) {
    return 0;
  }
  if (l >= L && r <= R) {
    return root->sum;
  }
  int m = (r + l) / 2;
  return getsum(root->left, L, R, l, m) + getsum(root->right, L, R, m, r);
}
void print(Node *root, int l, int r) {
  if (root == nullptr) {
    return;
  }
  push(root, l, r);
  cout << l + 1 << " " << r << " : " << root->sum << endl;
  int m = (r + l) / 2;
  print(root->left, l, m);
  print(root->right, m, r);
}
void solve() {
  n = readInt();
  q = readInt();
  for (int i = 0; i < (1 << n); ++i) {
    a[i] = readInt();
  }
  root = build(0, (1 << n));
  for (int i = 0; i < q; ++i) {
    int type = readInt();
    if (type == 1) {
      int ind = readInt(), x = readInt();
      --ind;
      change(root, 0, 1 << n, ind, x);
    }
    if (type == 2) {
      int k = readInt();
      reverse(k);
    }
    if (type == 3) {
      int k = readInt();
      swap(k);
    }
    if (type == 4) {
      int l = readInt(), r = readInt();
      --l;
      --r;
      writeInt(getsum(root, l, r + 1, 0, 1 << n));
      writeChar('\n');
    }
  }
}
signed main() {
  srand(time(0));
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12);
  int t = 1;
  while (t--) solve();
  return 0;
}
