#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N, Q;
  cin >> N >> Q;

  vector<ll> A(N, 0);
  ll cnt = 0;
  for (ll q = 0; q < Q; q++)
  {
    ll L, R;
    cin >> L >> R;
    L--, R--;

    for (ll i = L; i <= R; i++)
    {
      A.at(i) = 1 - A.at(i);
      cnt += (A.at(i) == 0 ? -1 : 1);
    }

    cout << cnt << '\n';
  }
}