#include <bits/stdc++.h>
using namespace std;
long long calc(long long x) { return x * (x + 1) / 2; }
struct SegTree {
  struct Node {
    int lm, rm;
    long long sum;
  } q[100010 << 2];
  void pushUp(int x, int l, int r, int m) {
    q[x].lm = q[((x) << 1)].lm;
    if (q[((x) << 1)].lm == m - l + 1) q[x].lm += q[(((x) << 1) | 1)].lm;
    q[x].rm = q[(((x) << 1) | 1)].rm;
    if (q[(((x) << 1) | 1)].rm == r - m) q[x].rm += q[((x) << 1)].rm;
    q[x].sum = q[((x) << 1)].sum - calc(q[((x) << 1)].rm) +
               q[(((x) << 1) | 1)].sum - calc(q[(((x) << 1) | 1)].lm) +
               calc(q[((x) << 1)].rm + q[(((x) << 1) | 1)].lm);
  }
  void build(int x, int l, int r, const int *a) {
    int mid = (((l) & (r)) + (((l) ^ (r)) >> 1));
    if (l == r) {
      q[x].lm = q[x].rm = a[l];
      q[x].sum = a[l];
      return;
    }
    build(((x) << 1), l, mid, a);
    build((((x) << 1) | 1), mid + 1, r, a);
    pushUp(x, l, r, mid);
  }
  void update(int x, int l, int r, int p, int val) {
    int mid = (((l) & (r)) + (((l) ^ (r)) >> 1));
    if (l == r) {
      q[x].lm = q[x].rm = val;
      q[x].sum = val;
      return;
    }
    if (p <= mid)
      update(((x) << 1), l, mid, p, val);
    else
      update((((x) << 1) | 1), mid + 1, r, p, val);
    pushUp(x, l, r, mid);
  }
  long long query(int x, int l, int r, int low, int high) {
    int mid = (((l) & (r)) + (((l) ^ (r)) >> 1));
    long long ret = 0;
    if (low <= l && r <= high) return q[x].sum;
    if (low <= mid) ret += query(((x) << 1), l, mid, low, high);
    if (high > mid) ret += query((((x) << 1) | 1), mid + 1, r, low, high);
    return ret;
  }
} st[21];
int a[21][100010], t[100010];
long long getSum() {
  int i;
  long long ret = 0;
  for (i = 0; i < 20; ++i) {
    ret += (st[i].q[1].sum << i);
  }
  return ret;
}
int main() {
  int n, m, i, j, p, x;
  long long ans;
  while (~scanf("%d %d", &n, &m)) {
    for (i = 0; i < n; ++i) {
      scanf("%d", &t[i]);
      for (j = 0; j < 20; ++j) a[j][i] = ((t[i] >> j) & 1);
    }
    for (i = 0; i < 20; ++i) st[i].build(1, 0, n - 1, a[i]);
    for (i = 0; i < m; ++i) {
      scanf("%d %d", &p, &x);
      t[p - 1] = x;
      for (j = 0; j < 20; ++j) st[j].update(1, 0, n - 1, p - 1, (x >> j) & 1);
      printf("%I64d\n", getSum());
    }
  }
  return 0;
}
