#include #define rep(i, n) for (int i = 0; i < n; ++i) typedef long long ll; using namespace std; int main() { int N, Q; cin >> N >> Q; int cur = 0; vector d(N + 1); while (Q--) { int l, r; cin >> l >> r; l--; for (int i = l; i < r; ++i) { d[i]++; if (d[i] % 2 == 1) cur++; else cur--; } cout << cur << "\n"; } return 0; }