#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
using namespace std;
const int maxn=2e6+10;
const int mod=1e9+7;
long long read(){
	long long ans=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-') f=-1;
	 	c=getchar();
	}
	while(c>='0'&&c<='9'){
	 	ans=ans*10+c-'0';
	 	c=getchar();
	}
	return ans*f;
}
long long n,m,t;
struct node{
	int l,r,a,b;
}h[maxn];
struct nod{
	int to,next;
}e[maxn*40];
int head[maxn*4],k=0;
void add(int x,int y){
	e[++k].next=head[x];
	e[k].to=y;
	head[x]=k;
}
struct nd{
	int sm,fl;
}tree[maxn*40];
long long ans=0;
void build(int id,int l,int r,int pl,int pr,long long tt){
	if(l==pl&&r==pr){
		add(id,tt);
		if(h[tt].b==0&&h[tt].a==1) ans-=tt*tt;
		if(l==r) h[tt].a++;
		else h[tt].b++;
		if(h[tt].b==0&&h[tt].a==1) ans+=tt*tt;
		return;
	}
	int mid=(l+r)/2;
	if(pr<=mid) build(id*2,l,mid,pl,pr,tt);
	else if(pl>mid) build(id*2+1,mid+1,r,pl,pr,tt);
	else{
		build(id*2,l,mid,pl,mid,tt);
		build(id*2+1,mid+1,r,mid+1,pr,tt);
	}
}
void down(int id){
	tree[id].fl=0;
	tree[id*2].sm=0;
	tree[id*2].fl=1;
	tree[id*2+1].sm=0;
	tree[id*2+1].fl=1;
}
void change(int id,int l,int r,int pl){
	tree[id].sm++;
	if(r-l==tree[id].sm){
		for(int i=head[id];i;i=e[i].next){
			long long tp=e[i].to;
			h[tp].b--;
			h[tp].a++;
			if(h[tp].b==0&&h[tp].a==1) ans+=tp*tp;
		}
	}
	else if(r-l+1==tree[id].sm){
		for(int i=head[id];i;i=e[i].next){
			long long tp=e[i].to;
			if(h[tp].b==0&&h[tp].a==1) ans-=tp*tp;
			h[tp].a--;
			if(h[tp].b==0&&h[tp].a==1) ans+=tp*tp;
		}
	}
	if(l==r) return;
	if(tree[id].fl) down(id);
	int mid=(l+r)/2;
	if(pl<=mid) change(id*2,l,mid,pl);
	else change(id*2+1,mid+1,r,pl);
}
int main(){
	t=read();
	while(t--){
		n=read();m=read();
		k=0;
		for(int i=1;i<=n*4;i++) head[i]=0;
		ans=0;
		for(int i=1;i<=m;i++){
			h[i].l=read()+1;
			h[i].r=read()+1;
			h[i].a=0;h[i].b=0;
			build(1,1,n,h[i].l,h[i].r,i);
		}
		for(int i=1;i<=n;i++){
			long long a=read();
			printf("%lld ",ans);
			a=(a+ans)%n+1;
			//for(int j=1;j<=m;j++) printf("\n%d %d**%d\n",h[j].a,h[j].b,a);
			change(1,1,n,a);
		}
		printf("0\n",ans);
		tree[1].fl=1;tree[1].sm=0;
	}
	return 0;
}