// https://www.youtube.com/watch?v=CrymicX875M
// Angel of mercy
// How did you move me
// Why am I on my feet again

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

void solve() {
    int n, m, p; cin >> n >> m >> p;
    // p linear functions
    vector<int> s(n);
    for (int i = 0; i < n; i++) cin >> s[i], s[i]--;
    // time, k, b
    vector<array<int, 3>> events;
    for (int i = 0; i < p; i++) {
        int a, t; cin >> a >> t;
        t %= m;
        int x = s[--a];
        if (t <= x) {
            // (x - t) - k
            events.push_back({0, -1, x - t});
            events.push_back({(x - t) + 1, 0, m});
        } else {
            // also (x - t) - k
            // but x - t < 0
            events.push_back({0, -1, x - t + m});
            if (x - t != -1) events.push_back({(x - t + m) + 1, 0, m});
        }
    }
    sort(events.begin(), events.end());
    i64 ans = 1e18, ksum = 0, bsum = 0;
    int ev = events.size();
    for (int i = 0, j = 0; i < ev; i = j) {
        for (j = i; j < ev && events[j][0] == events[i][0]; j++);
        int t = events[i][0], tr = j == ev ? m : events[j][0];
        for (int l = i; l < j; l++) {
            int k = events[l][1], b = events[l][2];
            ksum += k; bsum += b;
        }
        ans = min(ans, ksum * (tr - 1) + bsum);
    }
    cout << ans << "\n";
}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    };
}