Problem: Anton likes permutations, especially he likes to permute their elements. Note that a permutation of n elements is a sequence of numbers {a1, a2, ..., an}, in which every number from 1 to n appears exactly once.

One day Anton got a new permutation and started to play with it. He does the following operation q times: he takes two elements of the permutation and swaps these elements. After each operation he asks his friend Vanya, how many inversions there are in the new permutation. The number of inversions in a permutation is the number of distinct pairs (i, j) such that 1 ≤ i < j ≤ n and ai > aj.

Vanya is tired of answering Anton's silly questions. So he asked you to write a program that would answer these questions instead of him.

Initially Anton's permutation was {1, 2, ..., n}, that is ai = i for all i such that 1 ≤ i ≤ n.

Input

The first line of the input contains two integers n and q (1 ≤ n ≤ 200 000, 1 ≤ q ≤ 50 000) — the length of the permutation and the number of operations that Anton does.

Each of the following q lines of the input contains two integers li and ri (1 ≤ li, ri ≤ n) — the indices of elements that Anton swaps during the i-th operation. Note that indices of elements that Anton swaps during the i-th operation can coincide. Elements in the permutation are numbered starting with one.

Output

Output q lines. The i-th line of the output is the number of inversions in the Anton's permutation after the i-th operation.

Examples

Input

5 4
4 5
2 4
2 5
2 2


Output

1
4
3
3


Input

2 1
2 1


Output

1


Input

6 7
1 4
3 5
2 3
3 3
3 6
2 1
5 1


Output

5
6
7
7
10
11
8

Note

Consider the first sample.

After the first Anton's operation the permutation will be {1, 2, 3, 5, 4}. There is only one inversion in it: (4, 5).

After the second Anton's operation the permutation will be {1, 5, 3, 2, 4}. There are four inversions: (2, 3), (2, 4), (2, 5) and (3, 4).

After the third Anton's operation the permutation will be {1, 4, 3, 2, 5}. There are three inversions: (2, 3), (2, 4) and (3, 4).

After the fourth Anton's operation the permutation doesn't change, so there are still three inversions.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct treap {
  struct node {
    int key, priority, cnt;
    node *l, *r;
    int sz;
    node(int k) : priority(rand() << 16 ^ rand()), l(NULL), r(NULL), cnt(1) {
      init(k);
    }
    void init(int k) { sz = cnt, key = k; }
    node* refresh() {
      sz = cnt;
      sz += getSz(l) + getSz(r);
      return this;
    }
    void changeCount(int d) { cnt += d, sz += d; }
    static int getSz(node*& n) { return n ? n->sz : 0; }
  };
  node* root = NULL;
  pair<node*, node*> splitKey(node* curr, int key) {
    if (!curr) return {NULL, NULL};
    pair<node*, node*> res;
    if (curr->key <= key) {
      tie(curr->r, res.second) = splitKey(curr->r, key);
      res.first = curr->refresh();
    } else {
      tie(res.first, curr->l) = splitKey(curr->l, key);
      res.second = curr->refresh();
    }
    return res;
  }
  node* meld(node*& a, node*& b) {
    if (!a or !b) return a ? a : b;
    if (a->priority >= b->priority) {
      a->r = meld(a->r, b);
      return a->refresh();
    } else {
      b->l = meld(a, b->l);
      return b->refresh();
    }
  }
  void insert(int k) {
    auto a = splitKey(root, k - 1), b = splitKey(a.second, k);
    if (b.first)
      b.first->changeCount(1);
    else
      b.first = new node(k);
    root = meld(a.first, root = meld(b.first, b.second));
  }
  void erase(int k) {
    auto a = splitKey(root, k - 1), b = splitKey(a.second, k);
    if (!b.first)
      root = meld(a.first, b.second);
    else {
      b.first->changeCount(-1);
      root = meld(a.first, root = meld(b.first, b.second));
    }
  }
  int numBetween(int k1, int k2) {
    auto a = splitKey(root, k1 - 1), b = splitKey(a.second, k2);
    int res = node::getSz(b.first);
    root = meld(a.first, root = meld(b.first, b.second));
    return res;
  }
};
struct fenwickTree2D {
  struct node : treap {};
  vector<node> elements;
  fenwickTree2D(int s) { elements.resize(s + 1); }
  void insert(int i, int v) {
    for (i++; i < elements.size(); i += i & (-i)) elements[i].insert(v);
  }
  void replace(int i, int v, int old) {
    for (i++; i < elements.size(); i += i & (-i)) {
      elements[i].erase(old);
      elements[i].insert(v);
    }
  }
  int numBetween(int i, int k1, int k2) {
    int res = 0;
    for (i++; i > 0; i -= i & (-i)) res += elements[i].numBetween(k1, k2);
    return res;
  }
  int numBetween(int l, int r, int k1, int k2) {
    return numBetween(r, k1, k2) - numBetween(l - 1, k1, k2);
  }
};
int swapPositions(int l, int r, vector<int>& a, fenwickTree2D& ft) {
  int n = a.size();
  int change = 0;
  if (r - l >= 2) {
    if (a[l] < a[r])
      change = 2 * ft.numBetween(l + 1, r - 1, a[l] + 1, a[r] - 1);
    else
      change = -2 * ft.numBetween(l + 1, r - 1, a[r] + 1, a[l] - 1);
  }
  if (a[l] < a[r])
    change++;
  else if (a[l] > a[r])
    change--;
  ft.replace(l, a[r], a[l]), ft.replace(r, a[l], a[r]);
  swap(a[l], a[r]);
  return change;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  srand(time(0));
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  fenwickTree2D ft(n);
  for (int i = 0; i < n; i++) {
    a[i] = i;
    ft.insert(i, a[i]);
  }
  long long numInversions = 0;
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    if (l > r) swap(l, r);
    numInversions += swapPositions(l, r, a, ft);
    cout << numInversions << '\n';
  }
  return 0;
}