#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 5;
int N, Q;
int a[maxn], tri[maxn];
int lowbit(int x) {return x & -x;}
inline void add(int x, int c)
{
  for (int i = x; i <= N; i += lowbit(i)) tri[i] += c;
}
int sum(int x)
{
  int res = 0;
  for (int i = x; i; i -= lowbit(i)) res += tri[i];
  return res;
}
int query(int l, int r)
{
  return sum(r) - sum(l - 1);
}
int main()
{
  cin >> N >> Q;
  
  for (int i = 1; i <= N; i ++) 
  {
    add(i, a[i]);
  }
  for (int o = 0; o <= Q - 1; o ++)
  {
    int cnt = 0;
    int l, r; scanf("%d %d", &l, &r);
    for (int i = l; i <= r; i ++) add(i, 1);
    for (int i = 1; i <= N; i ++) 
    {
      if (query(i, i) & 1) cnt ++;
    }cout << cnt << "\n";
  }
  
  return 0;
}