#include<cstdio>
#include<iostream>
#include<vector>
#define RI register int
#define CI const int&
using namespace std;
const int N=500005;
int t,n,m,l,r,bkt[N],x; long long ans;
vector <int> lst[N];
class Segment_Tree
{
    private:
        vector <pair <int,int>> vec[N<<2]; int sum[N<<2];
        inline void reset(CI x)
        {
            for (auto [id,pos]:vec[x])
            {
                if (bkt[id]==1) ans-=1LL*id*id;
                bkt[id]-=lst[id][pos];
                lst[id][pos]=sum[x];
                bkt[id]+=lst[id][pos];
                if (bkt[id]==1) ans+=1LL*id*id;
            }
        }
    public:
        #define TN CI now=1,CI l=0,CI r=n-1
        #define LS now<<1,l,mid
        #define RS now<<1|1,mid+1,r
        inline void build(TN)
        {
            sum[now]=r-l+1; vec[now].clear(); if (l==r) return;
            int mid=l+r>>1; build(LS); build(RS);
        }
        inline void insert(CI beg,CI end,CI id,TN)
        {
            if (beg<=l&&r<=end)
            {
                lst[id].push_back(r-l+1);
                vec[now].push_back({id,lst[id].size()-1});
                return;
            }
            int mid=l+r>>1; if (beg<=mid) insert(beg,end,id,LS); if (end>mid) insert(beg,end,id,RS);
        }
        inline void update(CI pos,TN)
        {
            if (l==r)
            {
                sum[now]=0; reset(now); return;    
            }
            int mid=l+r>>1; if (pos<=mid) update(pos,LS); else update(pos,RS);
            sum[now]=sum[now<<1]+sum[now<<1|1];
            if (sum[now]==0||sum[now]==1) reset(now);
        }
        #undef TN
        #undef LS
        #undef RS
}SEG;
int main()
{
    // freopen("E.in","r",stdin);
    for (scanf("%d",&t);t;--t)
    {
        scanf("%d%d",&n,&m);
        for (RI i=1;i<=m;++i) lst[i].clear();
        SEG.build(); ans=0;
        for (RI i=1;i<=m;++i)
        {
            scanf("%d%d",&l,&r);
            bkt[i]=r-l+1; SEG.insert(l,r,i);
            if (bkt[i]==1) ans+=1LL*i*i;
        }
        printf("%lld ",ans);
        for (RI i=1;i<=n;++i)
        {
            scanf("%d",&x); x=(x+ans)%n;
            SEG.update(x); printf("%lld%c",ans," \n"[i==n]);
        }
    }
    return 0;
}