#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
#define QWQ cout<<"QwQ\n";
#define ll long long
#include <vector>
#include <queue>
#include <map>
#define ls now<<1
#define rs now<<1|1

using namespace std;
const ll N=501010;
const ll qwq=303030;
const ll inf=0x3f3f3f3f;

inline ll read() {
    ll sum = 0, ff = 1; char c = getchar();
    while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
    while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
    return sum * ff;
}

ll T;
ll n,m;
vector <ll> g[N<<2];
ll t[N<<2];
ll yi[N],ling[N],siz[N];
ll ans;

void check(ll now,ll cl) {
	// cout<<"check("<<now<<","<<cl<<")\n";
	if(cl==1) {
		for(ll v : g[now]) {
			yi[v]++;
			// cout<<" v = "<<v<<" yi = "<<yi[v]<<" ling = "<<ling[v]<<" siz = "<<siz[v]<<"\n";
			if(yi[v]==1 && ling[v]==siz[v]-1) ans += v*v;//, cout<<" + "<<v<<"\n";
		}
	}
	else {
		for(ll v : g[now]) {

			// cout<<" v = "<<v<<" yi = "<<yi[v]<<" ling = "<<ling[v]<<" siz = "<<siz[v]<<"\n";
			if(yi[v]==1 && ling[v]==siz[v]-1) ans -= v*v;//, cout<<" - "<<v<<"\n";
			yi[v]--;
			ling[v]++;
			if(yi[v]==1 && ling[v]==siz[v]-1) ans += v*v;//, cout<<" + "<<v<<"\n";
		}
	}
}

void built(ll now,ll l,ll r) {
	if(l==r) { t[now] = 1; return ; }
	ll mid = l+r >> 1;
	built(ls, l, mid);
	built(rs, mid+1, r);
	t[now] += t[ls] + t[rs];
}

void update(ll now,ll l,ll r,ll x) {
	t[now]--;
	if(t[now]==1 || t[now]==0) check(now,t[now]);
	if(l==r) return ;
	ll mid = l+r >> 1;
	if(x<=mid) update(ls, l, mid, x);
	else       update(rs, mid+1, r, x);
}

void insert(ll now,ll l,ll r,ll x,ll y,ll i) {
	if(x<=l && r<=y) {
		if(l==r) yi[i]++;
		g[now].push_back(i);
		siz[i]++;
		return ;
	}
	ll mid = l+r >> 1;
	if(x<=mid) insert(ls, l, mid, x, y, i);
	if(y>mid)  insert(rs, mid+1, r, x, y, i);
}

void chushihua() {
	ans = 0;
	for(ll i=1;i<=m;i++) yi[i] = ling[i] = siz[i] = 0;
	for(ll i=1;i<=4*n;i++) t[i] = 0, g[i].clear();
}

int main() {
	ll x,y;
    T = read();
    while(T--) {
		chushihua();
		n = read(); m = read();
		built(1, 1, n);
		for(ll i=1;i<=m;i++) {
			x = read()+1; y = read()+1;
			if(x==y) ans += i*i;
			insert(1, 1, n, x, y, i);
		}
		// for(int i=1;i<=9;i++) {
		// 	cout<<"I = "<<i<<" \n";
		// 	for(int v : g[i]) cout<<v<<" ";
		// 	cout<<endl;
		// }
		cout<<ans<<" ";
		for(ll i=1;i<=n;i++) {
			// cout<<i<<" : \n";
			x = (read()+ans) %n + 1;
			// cout<<"x = "<<x<<"\n";
			update(1, 1, n, x);
			cout<<ans<<" ";
		}
		cout<<endl;
    }
    return 0;
}

/*

3
5 4
2 4
2 3
3 3
0 2 3 2 4 2 0


2 1
1 1
1 0

2 1
0 1
0 0

*/