#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define int long long
const int N=1e5+9;
int n,m,Q,pos[N];
int st[N],sum;
int js(int x)
{
	int pos=upper_bound(st+1,st+Q+1,x-1)-st-1;
	return sum-x*Q+pos*m;
}
void work()
{
	sum=0;
	scanf("%lld%lld%lld",&n,&m,&Q);
	for(int i=1;i<=n;i++) scanf("%lld",&pos[i]),pos[i]--;
	for(int i=1;i<=Q;i++)
	{
		int id,tim;
		scanf("%lld%lld",&id,&tim);
		st[i]=((pos[id]-tim)%m+m)%m;sum+=st[i];
	}
	sort(st+1,st+Q+1);
	int ans=1e18;
	for(int i=1;i<=Q;i++) ans=min(ans,js(st[i]));
	ans=min(ans,js(0));
	ans=min(ans,js(m-1));
	printf("%lld\n",ans);
}
signed main()
{
	int T;
	scanf("%lld",&T);
	while(T--) work();
}