#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
struct node {
  long long sum = 0;
  bool rev, swp;
  node *left, *right;
  node(long long sum) : sum(sum) {
    rev = swp = 0;
    left = right = NULL;
  }
};
const int N = (1 << 18) + 5;
vector<int> swp(N, 0);
vector<int> rev(N, 0);
vector<int> v;
int n, q;
void build(node *root, int l = 0, int r = (1 << n) - 1) {
  if (l == r) {
    root->sum = v[l];
    return;
  }
  int mid = (l + r) >> 1;
  root->left = new node(0);
  root->right = new node(0);
  build(root->left, l, mid);
  build(root->right, mid + 1, r);
  root->sum = root->left->sum + root->right->sum;
}
void spread(node *root, int l, int r) {
  if (l != r) {
    int len = (r - l + 1);
    assert((1 << int(log2(len))) == len);
    if (swp[len] ^ root->swp) {
      root->swp ^= 1;
      swap(root->left, root->right);
    }
    if (rev[len] ^ root->rev) {
      root->rev ^= 1;
      swap(root->left, root->right);
      root->left->rev ^= 1;
      root->right->rev ^= 1;
    }
  }
}
void update(int x, int val, node *root, int l = 0, int r = (1 << n) - 1) {
  spread(root, l, r);
  if (l == r) {
    root->sum = val;
    return;
  }
  int mid = (l + r) >> 1;
  if (x <= mid)
    update(x, val, root->left, l, mid);
  else
    update(x, val, root->right, mid + 1, r);
  root->sum = root->left->sum + root->right->sum;
}
long long query(int x, int y, node *root, int l = 0, int r = (1 << n) - 1) {
  spread(root, l, r);
  if (l > y || r < x || x > y) return 0;
  if (x <= l && r <= y) return root->sum;
  int mid = (l + r) >> 1;
  long long a = query(x, y, root->left, l, mid);
  long long b = query(x, y, root->right, mid + 1, r);
  return a + b;
}
void solve() {
  node *root = new node(0);
  build(root);
  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int x, k;
      cin >> x >> k;
      update(x - 1, k, root);
    } else if (t == 2) {
      int k;
      cin >> k;
      rev[(1 << k)] ^= 1;
    } else if (t == 3) {
      int k;
      cin >> k;
      if (k == n) continue;
      swp[(1 << (k + 1))] ^= 1;
    } else if (t == 4) {
      int l, r;
      cin >> l >> r;
      cout << query(l - 1, r - 1, root) << "\n";
    }
  }
}
int main() {
  fast();
  cin >> n >> q;
  for (int i = 0; i < (1 << n); i++) {
    int a;
    cin >> a;
    v.push_back(a);
  }
  solve();
}
