Party hdu 6521

#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<queue>
using namespace std;
typedef long long ll;
const int N = 5e5 + 5;
int q[N];
int main() {
	int n, m;
	while (~scanf("%d%d", &n, &m)) {
		for (int i = 1; i <= n; i++) q[i] = i;
		
		for (int i = 1; i <= m; i++) {
			int v1, v2;
			scanf("%d %d", &v1, &v2);
			ll ans = 0;
			int j = v1;
			while (j < v2) {
				if (q[j] <= v2) {
					ans += v2 - q[j];
					q[j] = v2 ;
					j++;
				}
				else {
					break;
				}
			}
			printf("%lld\n", ans);
		}
		
	}
	return 0;
}