#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, Q;
  cin >> N >> Q;
  int cnt = 0;

  vector<int> lamps(N, 0);
  int l, r;
  for (int i = 0; i < Q; ++i) {
    cin >> l >> r;

    for (int j = l; j <= r; ++j) {
      lamps[j] ^= 1;

      if (lamps[j]) {
        ++cnt;
      } else {
        --cnt;
      }
    }

    cout << cnt << endl;
  }

  return 0;
}