#include <bits/stdc++.h>
using namespace std;
long long arr[(1 << 20)];
int swp[20];
int n, q;
struct TreeNode {
  long long sum;
  TreeNode *left, *right;
  TreeNode() : sum(0), left(nullptr), right(nullptr) {}
  TreeNode(long long val) : sum(val), left(nullptr), right(nullptr) {}
};
TreeNode* Create(int l, int r) {
  if (l == r) {
    TreeNode* node = new TreeNode(arr[l]);
    return node;
  }
  TreeNode* node = new TreeNode();
  int mid = (l + r) / 2;
  node->left = Create(l, mid);
  node->right = Create(mid + 1, r);
  node->sum = node->left->sum + node->right->sum;
  return node;
}
inline void reverseLevel(int k) {
  for (int i = k; i < 20; i++) swp[i] ^= 1;
}
inline void swapLevel(int k) { swp[k] ^= 1; }
void updateValue(TreeNode* node, int start, int end, int lev, int idx,
                 long long val) {
  if (start == end) {
    node->sum = val;
    return;
  }
  int mid = (start + end) / 2;
  if (start <= idx && idx <= mid) {
    if (swp[lev])
      updateValue(node->right, start, mid, lev + 1, idx, val);
    else
      updateValue(node->left, start, mid, lev + 1, idx, val);
  } else {
    if (swp[lev])
      updateValue(node->left, mid + 1, end, lev + 1, idx, val);
    else
      updateValue(node->right, mid + 1, end, lev + 1, idx, val);
  }
  node->sum = node->left->sum + node->right->sum;
}
long long query(TreeNode* node, int start, int end, int l, int r, int lev) {
  if (start > r or end < l or l > r or start > end) return 0;
  if (start >= l && end <= r) return node->sum;
  int mid = (start + end) / 2;
  long long val;
  if (!swp[lev])
    val = query(node->left, start, mid, l, r, lev + 1) +
          query(node->right, mid + 1, end, l, r, lev + 1);
  else
    val = query(node->right, start, mid, l, r, lev + 1) +
          query(node->left, mid + 1, end, l, r, lev + 1);
  return val;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q;
  for (int i = 0; i < (1 << n); i++) cin >> arr[i];
  TreeNode* root = Create(0, (1 << n) - 1);
  while (q--) {
    int type;
    int l, r;
    int x, k;
    cin >> type;
    switch (type) {
      case 1:
        cin >> x >> k;
        x--;
        updateValue(root, 0, (1 << n) - 1, 0, x, k);
        break;
      case 2:
        cin >> k;
        reverseLevel(n - k);
        break;
      case 3:
        cin >> k;
        swapLevel(n - k - 1);
        break;
      case 4:
        cin >> l >> r;
        l--;
        r--;
        long long ans = query(root, 0, (1 << n) - 1, l, r, 0);
        cout << ans << "\n";
        break;
    }
  }
}
