#include <bits/stdc++.h>
using namespace std;
const int maxn = 500;
const int maxn1 = 2e5 + 10;
int n, q, l, r;
int num[maxn][maxn], now[maxn1];
int cnt1[maxn], cnt2[maxn];
int tonum;
int bsearch(int l, int r, int x, int pos) {
  int mid;
  while (r >= l) {
    mid = (r - l) / 2 + l;
    if (num[x][mid] > pos)
      r = mid - 1;
    else
      l = mid + 1;
  }
  return l;
}
long long solve(int l, int r, long long val) {
  int num1, num2;
  int num3, num4;
  if (l % tonum == 0) {
    num1 = l / tonum;
    num3 = tonum;
  } else {
    num1 = l / tonum + 1;
    num3 = l % tonum;
  }
  if (r % tonum == 0) {
    num2 = r / tonum;
    num4 = tonum;
  } else {
    num2 = r / tonum + 1;
    num4 = r % tonum;
  }
  swap(now[l], now[r]);
  int i;
  i = tonum * (num1 - 1) + 1;
  for (int j = 1; j <= tonum; j++) {
    num[num1][j] = now[i];
    i++;
  }
  i = tonum * (num2 - 1) + 1;
  for (int j = 1; j <= tonum; j++) {
    num[num2][j] = now[i];
    i++;
  }
  sort(num[num1] + 1, num[num1] + tonum + 1);
  sort(num[num2] + 1, num[num2] + tonum + 1);
  long long sum = 0;
  for (int i = num1 + 1; i < num2; i++) {
    long long sum1, sum2;
    sum1 = bsearch(1, tonum, i, now[l]);
    sum2 = bsearch(1, tonum, i, now[r]);
    sum += sum1 - (tonum - sum1) + (tonum - sum2) - sum2;
  }
  if (num1 != num2) {
    for (int i = l + 1; i <= num1 * tonum; i++) {
      if (now[i] > now[l])
        sum--;
      else
        sum++;
      if (now[i] > now[r])
        sum++;
      else
        sum--;
    }
    for (int i = (num2 - 1) * tonum + 1; i < r; i++) {
      if (now[i] > now[l])
        sum--;
      else
        sum++;
      if (now[i] > now[r])
        sum++;
      else
        sum--;
    }
  } else {
    for (int i = l + 1; i < r; i++) {
      if (now[i] > now[l])
        sum--;
      else
        sum++;
      if (now[i] > now[r])
        sum++;
      else
        sum--;
    }
  }
  if (now[l] > now[r])
    sum++;
  else if (now[l] < now[r])
    sum--;
  return sum + val;
}
int main() {
  long long ans;
  cin >> n >> q;
  tonum = sqrt(n);
  int tot = 1;
  for (int i = 1; i <= n;) {
    for (int j = 1; j <= tonum; j++, i++) {
      num[tot][j] = i;
      now[i] = i;
    }
    tot++;
  }
  long long temp;
  temp = 0;
  while (q--) {
    cin >> l >> r;
    if (l > r) swap(l, r);
    ans = solve(l, r, temp);
    temp = ans;
    cout << ans << endl;
  }
  return 0;
}
