#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005;
const ll INF=15LL<<58;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,M,P;cin>>N>>M>>P;
        vl pos(N);
        for(int i=0;i<N;i++){
            cin>>pos[i];pos[i]--;
        }
        vl use;
        for(int i=0;i<P;i++){
            ll a,b;cin>>a>>b;a--;
            a=pos[a];
            b-=a;
            b%=M;
            if(b<0) b+=M;
            use.pb(b);
        }
        sort(all(use));
        
        ll ans=INF;
        
        vl rui(P+1);
        for(int i=1;i<=P;i++) rui[i]=rui[i-1]+use[i-1];
        
        for(int i=0;i<P;i++){
            ll cost=0;
            cost+=use[i]*P;
            cost-=rui[P];
            ll d=upper_bound(all(use),use[i])-use.begin();
            cost+=M*(P-d);
            chmin(ans,cost);
        }
        cout<<ans<<"\n";
    }
}