#include<bits/stdc++.h>
using namespace std;
template<class... A> void odn(A&&... a) {(int[]){(cout<<a<<' ',0)...}; cout<< '\n';}
#define dbg(x... ) odn(__LINE__, #x, ":", x)
using ll = long long;
const int B = 256, N = 5e5+5;

inline int BID(int x) {return x>>8;}
struct Node {
    vector<int> id;
    int num0;
};

struct Info {
    int ge1, num1;
};

#define M (L+R)>>1
#define lc (o<<1)
#define rc (o<<1|1)
void solve() {
    int n, m; cin>> n>> m;
    // vector<Node> T(4*n);
    vector<Node> T(1<<(__lg(n-1) + 2));
    // vector<pair<int,int>> sen(m);
    vector<Info> info(m);    

    auto updateR = [&](auto self, int o, int l, int r, int id, int L, int R, int& sum, int& sum2) {
        if (l <= L && R <= r) {
            T[o].id.push_back(id);
            // dbg(o, l, r, id, L, R);
            sum++;
            if (L+1 == R) sum2++;
            return;
        }
        if (l < M) self(self, lc, l, r, id, L, M, sum, sum2);
        if (r > M) self(self, rc, l, r, id, M, R, sum, sum2);
    };
    ll ans =0;
    auto queryP = [&](auto self, int o, int p, int L, int R) {
        T[o].num0++;
        // dbg(o, p, L, R, T[o].num0);
        if (T[o].num0 == R-L) {
            for (int v : T[o].id) {
                info[v].num1--;
                info[v].ge1--;
                // dbg(v, info[v].num1, info[v].ge1);
                if (info[v].num1 == 1 && info[v].ge1 == 1) {
                    ans += 1ll * (v+1)*(v+1);
                }
                if (info[v].ge1 == 0) {
                    ans -= 1ll * (v+1)*(v+1);
                }
            }
        } else if (T[o].num0 + 1 == R-L) {
            for (int v : T[o].id) {
                info[v].num1++;
                if (info[v].num1 == 1 && info[v].ge1 == 1) {
                    ans += 1ll * (v+1)*(v+1);
                }
            }
        }

        if (L+1 == R) {
            return;
        }
        if (p < M) self(self, lc, p, L, M);
        else self(self, rc, p, M, R);
    };

    for (int i = 0; i < m; i++) {
        int x, y; cin>> x>> y; // x--, y--;
        // sen[i] = make_pair(x, y);
        int sum=0, sum2=0;
        updateR(updateR, 1, x, y+1, i, 0, n, sum, sum2);
        info[i].ge1 = sum;
        info[i].num1 = sum2;
        if (x == y) {
            ans += 1ll*(i+1)*(i+1);
        }
    }
    // odn(1);
    for (int i = 0; i < n; i++) {
        cout<< ans<< ' ';
        int a; cin>> a;
        a = (a + ans) % n;
        queryP(queryP, 1, a, 0, n);
    }
    cout<< ans;
    cout<< '\n';
}
/*
9 # 2 1 1 0 # 
# 2 3 2 0 # 
13 # 0 3 1 0 # 
29 # 3 1 0 0 # 
# 3 2 0 0 # 
16 # 3 1 -1 0 # 
# 3 2 -1 0 # 
16 # 1 3 0 0 # 
0
*/

int main(){
    //freopen("i", "r", stdin);
    // std::ios::sync_with_stdio(false);
    // std::cin.tie(nullptr);
    int T;
    std::cin >>T;
    // T = 1;
    while(T--){
        solve();
    }
    return 0;
}