#include <bits/stdc++.h>
using namespace std;
const long long N = 3 * 1e5 + 100;
long long n, q, a[N], vi[4][20], sum[20][N];
inline long long get(long long x, long long id) {
  for (long long i = id; i < n; i++) {
    if (vi[3][i]) {
      long long len = (1 << (i - id)), tmp = (x - 1) / len + 1;
      if (tmp & 1)
        x += len;
      else
        x -= len;
    }
  }
  for (long long i = id + 1; i <= n; i++) {
    if (vi[2][i]) {
      long long len = (1 << (i - id)), tmp = (x - 1) / len + 1;
      long long mid = len * tmp + len * (tmp - 1) + 1;
      x = mid - x;
    }
  }
  return x;
}
inline long long getsum(long long x) {
  long long ans = 0, last = 0;
  for (long long i = n; i >= 0; i--) {
    if (last + (1 << i) <= x) {
      long long tmp = (last / (1 << i)) + 1;
      ans += sum[i][get(tmp, i)];
      last += (1 << i);
    }
  }
  return ans;
}
signed main() {
  scanf("%lld%lld", &n, &q);
  for (long long i = 1; i <= (1 << n); i++)
    scanf("%lld", &a[i]), sum[0][i] = a[i];
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= (1 << (n - i)); j++)
      sum[i][j] = sum[i - 1][2 * j - 1] + sum[i - 1][2 * j];
  }
  while (q--) {
    long long op;
    scanf("%lld", &op);
    if (op == 1) {
      long long x, k;
      scanf("%lld%lld", &x, &k);
      long long delta = k - sum[0][get(x, 0)];
      for (long long i = 0; i <= n; i++)
        sum[i][get((x - 1) / (1 << i) + 1, i)] += delta;
    }
    if (op == 2 || op == 3) {
      long long k;
      scanf("%lld", &k);
      vi[op][k] ^= 1;
    }
    if (op == 4) {
      long long l, r;
      scanf("%lld%lld", &l, &r);
      printf("%lld\n", getsum(r) - getsum(l - 1));
    }
  }
}
