#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 10, MD = 1e9 + 7, LG = 20;
long long n, m, a[MX], ans, tmp;
struct node {
  long long ans = 0, pre = 0, suf = 0;
} seg[LG][MX * 4];
node Merge(node a, node b, int e, int s) {
  int mid = (s + e) / 2;
  node res;
  res.ans = a.ans + b.ans - (a.suf * (a.suf + 1)) / 2 -
            (b.pre * (b.pre + 1)) / 2 +
            ((a.suf + b.pre) * (a.suf + b.pre + 1)) / 2;
  res.pre = a.pre;
  if (res.pre == mid - s) res.pre += b.pre;
  res.suf = b.suf;
  if (res.suf == e - mid) res.suf += a.suf;
  return res;
}
void build(int val, int id = 1, int s = 0, int e = n) {
  if (e - s == 1) {
    if (a[s] & (1 << val)) {
      seg[val][id].ans = 1;
      seg[val][id].suf = 1;
      seg[val][id].pre = 1;
    }
    return;
  }
  int mid = (s + e) / 2;
  build(val, id * 2, s, mid);
  build(val, id * 2 + 1, mid, e);
  seg[val][id] = Merge(seg[val][id * 2], seg[val][id * 2 + 1], e, s);
}
void update(int ind, int val2, int val, int id = 1, int s = 0, int e = n) {
  if (e - s == 1) {
    if (val == 1) {
      seg[val2][id].ans = 1;
      seg[val2][id].suf = 1;
      seg[val2][id].pre = 1;
    } else {
      seg[val2][id].ans = 0;
      seg[val2][id].suf = 0;
      seg[val2][id].pre = 0;
    }
    return;
  }
  int mid = (s + e) / 2;
  if (mid > ind)
    update(ind, val2, val, id * 2, s, mid);
  else
    update(ind, val2, val, id * 2 + 1, mid, e);
  seg[val2][id] = Merge(seg[val2][id * 2], seg[val2][id * 2 + 1], e, s);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < LG; i++) build(i);
  while (m--) {
    int p, v;
    cin >> p >> v;
    p--;
    ans = 0;
    for (int i = 0; i < LG; i++) {
      if (v & (1 << i)) {
        update(p, i, 1);
      } else {
        update(p, i, 0);
      }
      ans += seg[i][1].ans * (1 << i);
    }
    cout << ans << endl;
  }
}
