#include <bits/stdc++.h>
using namespace std;
int n, m, x;
long long Summa;
set<int> Zeros[18], Ones[18];
set<int>::iterator IterateOverElements;
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < 18; i++) {
    Zeros[i].insert(n), Ones[i].insert(n);
    Zeros[i].insert(-1), Ones[i].insert(-1);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    int k = 1;
    int index = -1;
    while (true) {
      index++;
      if (index == 18) break;
      if (k & x)
        Ones[index].insert(i);
      else
        Zeros[index].insert(i);
      k <<= 1;
    }
  }
  long long Val = 1;
  for (int i = 0; i < 18; i++) {
    int posBegin = 0;
    while (true) {
      posBegin = *Ones[i].lower_bound(posBegin);
      if (posBegin == n) {
        break;
      }
      IterateOverElements = Zeros[i].upper_bound(posBegin);
      long long Right = *IterateOverElements;
      long long Left = (*--IterateOverElements);
      Summa += Val * (Right - Left - 1) * (Right - Left) / 2;
      posBegin = *Zeros[i].lower_bound(posBegin);
    }
    Val *= 2;
  }
  for (int i = 0; i < m; i++) {
    int position, v;
    scanf("%d %d", &position, &v);
    --position;
    long long k = 1;
    int index = -1;
    while (1) {
      index++;
      if (index == 18) break;
      if (k & v) {
        IterateOverElements = Ones[index].lower_bound(position);
        if (*IterateOverElements != position) {
          set<int>::iterator m_it = Zeros[index].lower_bound(position);
          IterateOverElements = m_it;
          long long Right = *++m_it;
          long long Middle = position;
          long long Left = *--IterateOverElements;
          Summa += k * (Right - Left - 1) * (Right - Left) / 2 -
                   k * (Middle - Left - 1) * (Middle - Left) / 2 -
                   k * (Right - Middle - 1) * (Right - Middle) / 2;
          Zeros[index].erase(position);
          Ones[index].insert(position);
        }
      } else {
        IterateOverElements = Zeros[index].lower_bound(position);
        if (*IterateOverElements != position) {
          long long Middle = position;
          long long Right = *IterateOverElements;
          long long Left = *--IterateOverElements;
          Summa -= k * (Right - Left - 1) * (Right - Left) / 2 -
                   k * (Right - Middle - 1) * (Right - Middle) / 2 -
                   k * (Middle - Left - 1) * (Middle - Left) / 2;
          Ones[index].erase(position);
          Zeros[index].insert(position);
        }
      }
      k <<= 1;
    }
    printf("%I64d\n", Summa);
  }
  return 0;
}
