#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/Assert/Assert.hpp"
#include <cassert>
#include <iostream>
#include <string>
#ifndef MY_ASSERT
#define MY_ASSERT

#ifdef LOCAL

#define ASSERT_MSG(expr, msg)                                                                                          \
  do {                                                                                                                 \
    if (!(expr)) {                                                                                                     \
      std::cerr << msg << std::endl;                                                                                   \
      assert(expr);                                                                                                    \
    }                                                                                                                  \
  } while (0)

#define FAIL ASSERT_MSG(false, "到達しない想定の場所に到達しました")

#else

#define ASSERT_MSG(...) (void)0
#define FAIL (void)0

#endif

#endif
#line 2 "/workspaces/compro/lib/io/vector.hpp"
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 5 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define RFOR(i, m, n) for (int i = (n - 1); i >= (m); i--)
#define ALL(v) std::begin(v), std::end(v)
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

struct P {
  ll x;
  ll y;
};

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 2 "main.cpp"

void solve(long long N, int Q, const std::vector<long long> &L, const std::vector<long long> &R) {
  vector<bool> on(N, false);
  int sum = 0;
  REP(i, Q) {
    FOR(j, L[i], R[i] + 1) {
      if (on[j])
        sum--;
    }
    FOR(j, L[i], R[i] + 1) {
      on[j] = !on[j];
      if (on[j])
        sum++;
    }
    cout << sum << endl;
  }
}

// generated by oj-template v4.8.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long long N;
  int Q;
  std::cin >> N >> Q;
  std::vector<long long> L(Q), R(Q);
  for (int i = 0; i < Q; ++i) {
    std::cin >> L[i] >> R[i];
    L[i]--;
    R[i]--;
  }
  solve(N, Q, L, R);
  return 0;
}