#define _CRT_SECURE_NO_WARNINGS
#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<string>
#include<vector>
#include<queue>
using namespace std;

const int N=100010;
typedef long long ll;
const ll inf=1000000000000000000ll;
int n,m,p,a[N],b[N];
struct Node{
	int id,t;
}c[N];

struct Ele{
	int id,aid,tim; //队伍编号 入队时的等待时间
	Ele(int _id,int _aid,int _tim):id(_id),aid(_aid),tim(_tim){}
	inline bool operator<(const Ele that){
		return tim<that.tim;
	}
};
deque<Ele>q;
vector<Ele>init;

//获得x位置 + val 的位置 (下标1..m)
inline int getpos(int x,int val)
{
	val=(val%m+m)%m;
	x+=val;
	if(x>m)x-=m;
	return x;
}

//y是机器人位置 x是队伍 
inline int dis(int x,int y)
{
	if(x>=y)return x-y;
	else return m-y+x-1+1;
}

int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d%d",&n,&m,&p);
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		
		for(int i=1;i<=p;i++)
			scanf("%d%d",&c[i].id,&c[i].t),c[i].t%=m,b[i]=getpos(a[c[i].id],-c[i].t);
		sort(b+1,b+1+p);
		int tot=unique(b+1,b+1+p)-b-1;
		//cout<<"b ";
		//for(int i=1;i<=tot;i++)
		//	cout<<b[i]<<" ";
		//cout<<endl;

		while(q.size())q.pop_back();
		init.clear();
		int st=b[1];    //机器人第一个开始的位置是 位置最小的队伍的位置-1
		ll posans=0,q1sum=0,q2sum=0,cnt=0;   //cnt是q2里元素的个数
		ll ans=inf;
		for(int i=1;i<=p;i++)
		{
			int d=dis(a[c[i].id],getpos(st,c[i].t));
			//cout<<"i "<<d<<endl;
			posans+=1ll*d;
			init.push_back(Ele(i,c[i].id,d));
		}
		
		ans=min(ans,posans);
		q1sum=posans;
		//cout<<q1sum<<" "<<q2sum<<" "<<cnt<<" "<<posans<<endl;
		sort(init.begin(),init.end());
		for(auto pos:init)
			q.push_back(pos);
		int lstst=b[1];
		for(int i=2;i<=tot;i++)
		{
			int posst=b[i];
			q2sum-=cnt*(1ll*posst-lstst);
			while(q.size()&&q.front().tim<posst-st)
			{
				Ele pos=q.front();
				q1sum-=pos.tim;
				//cout<<"while "<<pos.id<<" "<<c[pos.id].t<<" "<<getpos(b[i],c[pos.id].t)<<\
					" "<<dis(a[pos.aid],getpos(b[i],c[pos.id].t))<<endl;

				q2sum+=dis(a[pos.aid],getpos(b[i],c[pos.id].t));
				cnt++;
				q.pop_front();
			}
			
			int siz=q.size();
			posans=q1sum-1ll*siz*(1ll*posst-st)+q2sum;
			//cout<<q1sum<<" "<<q2sum<<" "<<cnt<<" "<<posans<<endl;
			ans=min(ans,posans);
			lstst=b[i];
		}
		printf("%lld\n",ans);
	}
	return 0;
}