#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000010;
int n,m,c[N];ll a[N],b[N],ans[N];
namespace sub1{
	ll mdy(int x,int y){
		a[x]=y;ll mx=0,res=0;
		for(int i=1;i<=n;i++){
			mx=max(mx,a[i]);
			b[i]+=mx;
			if(i<=x)res+=b[i];
		}
		return res;
	}
	void solve(){
		while(m--){
			int x,y;scanf("%d%d",&x,&y);
			printf("%lld\n",mdy(x,y));
		}
	}
}
namespace sub2{
	struct tree{
		ll sum,sum_;int mx,se;
		int la1,la2,cnt;ll la3;
	}tr[N<<2];
	struct qry{
		int id,x,y;
		bool operator<(const qry&t)const{
			if(x!=t.x)return x<t.x;
			return id<t.id;
		}
	}p[N];
	int lowbit(int x){
		return x&-x;
	}
	void mdy(int x,int y){
		while(x<=n){
			c[x]=max(c[x],y);
			x+=lowbit(x);
		}
	}
	int qry(int x){
		int res=0;
		while(x){
			res=max(res,c[x]);
			x-=lowbit(x);
		}
		return res;
	}
	void merge(tree &x,tree y){
		x.sum_+=1ll*y.la1*x.sum+1ll*x.cnt*y.la3;
		x.la1+=y.la1;x.la3+=y.la3;
		x.la3+=1ll*x.la2*y.la1;
		x.sum+=1ll*x.cnt*y.la2;x.mx+=y.la2;
		x.la2+=y.la2;
	}
	void pushdown(int u){
		tree qw;int tmp=min(tr[u<<1].mx,tr[u<<1|1].mx);
		qw=tr[u];if(tr[u<<1].mx!=tmp)qw.la2=qw.la3=0;
		merge(tr[u<<1],qw);
		qw=tr[u];if(tr[u<<1|1].mx!=tmp)qw.la2=qw.la3=0;
		merge(tr[u<<1|1],qw);
		tr[u].la1=tr[u].la2=tr[u].la3=0;
	}
	void pushup(int u){
		tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum;
		tr[u].sum_=tr[u<<1].sum_+tr[u<<1|1].sum_;
		tr[u].mx=min(tr[u<<1].mx,tr[u<<1|1].mx);
		if(max(tr[u<<1].mx,tr[u<<1|1].mx)>tr[u].mx){
			if(tr[u<<1].mx==tr[u].mx)tr[u].se=min(tr[u<<1].se,tr[u<<1|1].mx);
			else tr[u].se=min(tr[u<<1].mx,tr[u<<1|1].se);
		}
		else tr[u].se=min(tr[u<<1].se,tr[u<<1|1].se);
		tr[u].cnt=0;
		if(tr[u].mx==tr[u<<1].mx)tr[u].cnt+=tr[u<<1].cnt;
		if(tr[u].mx==tr[u<<1|1].mx)tr[u].cnt+=tr[u<<1|1].cnt;
	}
	void build(int u,int l,int r){
		tr[u].la1=tr[u].la2=tr[u].la3=0;
		if(l==r){
			tr[u].cnt=1;tr[u].mx=0;tr[u].se=0x3f3f3f3f;
			return;
		}
		int mid=l+r>>1;
		build(u<<1,l,mid);
		build(u<<1|1,mid+1,r);
		pushup(u);
	}
	void modify(int u,int l,int r,int L,int R,int qw){
		if(tr[u].mx>=qw)return;
		if(l==L&&r==R&&tr[u].se>qw){
			merge(tr[u],{0,0,0,0,0,qw-tr[u].mx,0,0});	
			return;
		}
		pushdown(u);
		int mid=l+r>>1;
		if(R<=mid)modify(u<<1,l,mid,L,R,qw);
		else if(L>mid)modify(u<<1|1,mid+1,r,L,R,qw);
		else modify(u<<1,l,mid,L,mid,qw),modify(u<<1|1,mid+1,r,mid+1,R,qw);
		pushup(u);
	}
	ll query(int u,int l,int r,int L,int R){
		if(l==L&&r==R){
			return tr[u].sum_;
		}
		pushdown(u);
		int mid=l+r>>1;
		if(R<=mid)return query(u<<1,l,mid,L,R);
		else if(L>mid)return query(u<<1|1,mid+1,r,L,R);
		else return query(u<<1,l,mid,L,mid)+query(u<<1|1,mid+1,r,mid+1,R);
	}
	int qry2(int x){
		int l=1,r=n;
		while(l<r){
			int mid=l+r+1>>1;
			if(qry(mid)<=a[x])l=mid;
			else r=mid-1;
		} 
		if(qry(l)>a[x])return 0;
		return l;
	}
	void solve(){
		build(1,1,m);
		for(int i=1;i<=m;i++){
			int x,y;scanf("%d%d",&x,&y);
			p[i]={i,x,y};
		}
		sort(p+1,p+1+m);
		for(int i=1,k=0;i<=m;i++){
			while(k<p[i].x){
				merge(tr[1],{0,0,0,0,1,0,0,0});k++;
			}
			int j=i;
			for(;j<=m;j++){
				if(p[j].x!=p[i].x)break;
			}
			j--;
			
			for(int l=i;l<=j;l++){
				if(l<j)modify(1,1,m,p[l].id,p[l+1].id-1,p[l].y);
				else modify(1,1,m,p[l].id,m,p[l].y);
			}
			k++;merge(tr[1],{0,0,0,0,1,0,0,0});
			for(int l=i;l<=j;l++){
				ans[p[l].id]=query(1,1,m,1,p[l].id);
			}
			i=j;
		}
		for(int i=1;i<=m;i++){
			cout<<ans[i]<<"\n";
		}
	}
}
int main(){
//	freopen("array0_4.in","r",stdin);
//	freopen("qwq.out","w",stdout);
	cin>>n>>m;
	sub2::solve();
	return 0;
}