#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=5e5+10;
int T,n,m,k,a[N],b[N];
ll c[N];
void get(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),a[i]--;
	for(int x,y,i=1;i<=k;i++){
		scanf("%d%d",&x,&y),b[i]=(a[x]-y%m+m)%m;
	}
	copy(b,b+1+k,a);
	sort(a+1,a+1+k),n=unique(a+1,a+1+k)-a-1;
	for(int i=1;i<=k;i++){
		int x=lower_bound(a+1,a+1+n,b[i])-a;
		c[n]+=m+b[i],c[x]-=m;
	}
	for(int i=n;i>1;i--)c[i-1]+=c[i];
	ll ans=LLONG_MAX;
	for(int i=1;i<=n;i++){
		ans=min(ans,c[i]-1ll*k*a[i]);
	}
	printf("%lld\n",ans);
}
void clr(){
	for(int i=0;i<=k+1;i++)c[i]=0;
}
int main(){
	for(scanf("%d",&T);T--;clr())get();
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif