#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
const int M = 510;
const int MOD = 1e9 + 7;
const long long inf = 1 << 30;
void fre() { freopen("in.txt", "r", stdin); }
inline long long read() {
  long long x = 0, f = 1;
  char c;
  c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') {
      f = -1;
    }
    c = getchar();
  }
  while (c <= '9' && c >= '0') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
const double eps = 1e-8;
int st[N], ed[N];
int a[N * N];
vector<int> g[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int num = (int)sqrt(n);
  for (int i = 0; i < n / num; i++) {
    st[i] = i * num + 1;
    ed[i] = (i + 1) * (num);
  }
  if (n % num != 0) {
    st[n / num] = n - n % num + 1;
    ed[n / num] = n;
  }
  for (int i = 1; i <= n; i++) {
    a[i] = i;
    g[(i - 1) / num].push_back(i);
  }
  long long ans = 0;
  int l, r;
  while (m--) {
    cin >> l >> r;
    if (l == r) {
      cout << ans << endl;
      continue;
    }
    if (l > r) swap(l, r);
    int stl = (l - 1) / num;
    int str = (r - 1) / num;
    for (int i = stl + 1; i <= str - 1; i++) {
      int p = lower_bound(g[i].begin(), g[i].end(), a[l]) - g[i].begin();
      ans -= p;
      ans += g[i].size() - p;
      p = lower_bound(g[i].begin(), g[i].end(), a[r]) - g[i].begin();
      ans += p;
      ans -= g[i].size() - p;
    }
    for (int i = l + 1; i <= ed[stl] && i < r; i++) {
      if (a[i] > a[l])
        ans++;
      else
        ans--;
      if (a[i] > a[r])
        ans--;
      else
        ans++;
    }
    for (int i = st[str]; i < r && i > l; i++) {
      if (a[i] > a[l])
        ans++;
      else
        ans--;
      if (a[i] > a[r])
        ans--;
      else
        ans++;
    }
    g[stl].erase(lower_bound(g[stl].begin(), g[stl].end(), a[l]));
    g[str].erase(lower_bound(g[str].begin(), g[str].end(), a[r]));
    g[stl].push_back(a[r]);
    g[str].push_back(a[l]);
    sort(g[stl].begin(), g[stl].end());
    sort(g[str].begin(), g[str].end());
    if (a[l] < a[r])
      ans++;
    else
      ans--;
    swap(a[l], a[r]);
    cout << ans << endl;
  }
  return 0;
}
