Problem: Inna is fed up with jokes about female logic. So she started using binary logic instead.

Inna has an array of n elements a1[1], a1[2], ..., a1[n]. Girl likes to train in her binary logic, so she does an exercise consisting of n stages: on the first stage Inna writes out all numbers from array a1, on the i-th (i ≥ 2) stage girl writes all elements of array ai, which consists of n - i + 1 integers; the k-th integer of array ai is defined as follows: ai[k] = ai - 1[k] AND ai - 1[k + 1]. Here AND is bit-wise binary logical operation.

Dima decided to check Inna's skill. He asks Inna to change array, perform the exercise and say the sum of all <image> elements she wrote out during the current exercise.

Help Inna to answer the questions!

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105) — size of array a1 and number of Dima's questions. Next line contains n integers a1[1], a1[2], ..., a1[n] (0 ≤ ai ≤ 105) — initial array elements.

Each of next m lines contains two integers — Dima's question description. Each question consists of two integers pi, vi (1 ≤ pi ≤ n; 0 ≤ vi ≤ 105). For this question Inna should make a1[pi] equals vi, and then perform the exercise. Please, note that changes are saved from question to question.

Output

For each question print Inna's answer on a single line.

Examples

Input

3 4
1 1 1
1 1
2 2
3 2
1 2


Output

6
4
7
12

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
#pragma GCC diagnostic ignored "-Wsign-compare"
int n, m;
vector<int> a(1e5 + 5, 0);
vector<set<int> > v(17);
long long ret = 0;
long long calc(int second, int first) {
  long long cnt = second - first - 1;
  return cnt * (cnt + 1) / 2;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int o = 0; o <= 16; o++) {
    v[o].insert(0);
    v[o].insert(n + 1);
    int cnt = 0;
    int num = 1 << o;
    for (int i = 1; i <= n; i++)
      if (a[i] & num) {
        cnt++;
      } else {
        v[o].insert(i);
        ret += cnt * (cnt + 1ll) / 2 * num;
        cnt = 0;
      }
    ret += cnt * (cnt + 1ll) / 2 * num;
  }
  for (int i = 0; i < m; i++) {
    int p, c;
    cin >> p >> c;
    for (int o = 0; o <= 16; o++) {
      int num = 1 << o;
      int tag = c & num;
      if (tag == (a[p] & num)) continue;
      if (tag) {
        auto t = v[o].find(p);
        auto l = t;
        auto r = t;
        --l;
        ++r;
        v[o].erase(t);
        ret -= calc(*t, *l) * num;
        ret -= calc(*r, *t) * num;
        ret += calc(*r, *l) * num;
      } else {
        auto t = v[o].insert(p).first;
        auto l = t;
        auto r = t;
        --l;
        ++r;
        ret -= calc(*r, *l) * num;
        ret += calc(*t, *l) * num;
        ret += calc(*r, *t) * num;
      }
    }
    a[p] = c;
    cout << ret << endl;
  }
  return 0;
}