#include<bits/stdc++.h>
using namespace std;
const int N = 500000 + 200;
int val[N];
long long ans;
struct node{
    int sum;
    vector<int>idx;
}tree[4 * N];
void build(int l,int r,int x){
    tree[x].sum = r - l + 1;
    tree[x].idx.clear();
    if(l == r){
        return;
    }
    int mid = (l + r) / 2;
    build(l,mid,2 * x),build(mid + 1,r,2 * x + 1);
}
void insert(int l,int r,int x,int L,int R,int idx){
    if(r < L || l > R)
        return;
    if(L <= l && R >= r){
        tree[x].idx.push_back(idx);
        return;
    }
    int mid = (l + r) / 2;
    insert(l,mid,2 * x,L,R,idx);
    insert(mid + 1,r,2 * x + 1,L,R,idx);
}
void query(int l,int r,int x,int k){
    tree[x].sum --;
    if(tree[x].sum <= 1){
        if(tree[x].sum == 1){
            for(auto v:tree[x].idx){
                val[v] -= r - l;
                if(val[v] == 1)
                    ans += 1LL * v * v;
            }
        } else {
            for(auto v:tree[x].idx){
                val[v] --;
                if(val[v] == 0)
                    ans -= 1LL * v * v;
                if(val[v] == 1)
                    ans += 1LL * v * v;
            }
        }
    }
    if(l == r){
        return;
    }
    int mid = (l + r) / 2;
    if(k <= mid)
        query(l,mid,2 * x,k);
    else
        query(mid + 1,r,2 * x + 1,k);
}
void solve()
{
    int n,m;
    cin>>n>>m;
    ans = 0;
    build(1,n,1);
    for(int i = 1;i <= m;i ++){
        int l,r;
        cin>>l>>r;
        l ++,r ++;
        val[i] = r - l + 1;
        insert(1,n,1,l,r,i);
        if(val[i] == 1)
            ans += 1LL * i * i;
    }
    cout<<ans<<" ";
    for(int i = 1;i <= n;i ++){
        long long idx;
        cin>>idx;
        idx = (idx + ans) % n;
        idx ++;
        query(1,n,1,idx);
        cout<<ans<<" ";
    }
    cout<<"\n";
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T;
    cin>>T;
    while(T --)
        solve();
}