#include <bits/stdc++.h>
using namespace std;
const long long MXN = 5e5 + 10;
const long long MXS = MXN * 4;
long long n, q;
long long A[MXN];
long long Seg[MXS], Lazy[MXS], LC[MXS], RC[MXS], Is_Rev[MXS];
void Build(long long id = 1, long long s = 1, long long e = n) {
  if (s == e) {
    Seg[id] = A[s];
    return;
  }
  LC[id] = (id * 2), RC[id] = (id * 2 + 1);
  Build((id * 2), s, ((s + e) / 2)), Build((id * 2 + 1), ((s + e) / 2 + 1), e);
  Seg[id] = Seg[(id * 2)] + Seg[(id * 2 + 1)];
}
inline void Shift(long long id, long long s, long long e) {
  Seg[id] += Lazy[id];
  if (s == e) {
    Lazy[id] = 0;
    return;
  }
  Lazy[(id * 2)] += Lazy[id], Lazy[(id * 2 + 1)] += Lazy[id];
  Lazy[id] = 0;
}
void Upd(long long ind, long long x, long long id = 1, long long s = 1,
         long long e = n) {
  Shift(id, s, e);
  if (e < ind || s > ind) return;
  if (s == e) {
    Seg[id] = x;
    return;
  }
  if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
  Upd(ind, x, LC[id], s, ((s + e) / 2)),
      Upd(ind, x, RC[id], ((s + e) / 2 + 1), e);
  if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
  Seg[id] = Seg[(id * 2)] + Seg[(id * 2 + 1)];
}
long long Get(long long l, long long r, long long id = 1, long long s = 1,
              long long e = n) {
  Shift(id, s, e);
  if (e < l || s > r) return 0;
  if (l <= s && e <= r) return Seg[id];
  if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
  long long ans = Get(l, r, LC[id], s, ((s + e) / 2)) +
                  Get(l, r, RC[id], ((s + e) / 2 + 1), e);
  if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q, n = (1LL << n);
  for (int i = 1; i <= n; i++) cin >> A[i];
  Build();
  while (q--) {
    long long typ, x, k, l, r;
    cin >> typ;
    switch (typ) {
      case 1:
        cin >> x >> k;
        Upd(x, k);
        break;
      case 2:
        cin >> k;
        for (int i = 0; i <= k; i++) Is_Rev[(1LL << i)] = !Is_Rev[(1LL << i)];
        break;
      case 3:
        cin >> k;
        k++;
        Is_Rev[(1LL << k)] = !Is_Rev[(1LL << k)];
        break;
      case 4:
        cin >> l >> r;
        cout << Get(l, r) << '\n';
        break;
    }
  }
  return 0;
}
