#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr int inf = 0x3f3f3f3f;
constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

constexpr int N = 200000;

void A_SOUL_AvA () {
    int a, n, q, P;
    cin >> P >> a >> n >> q;
    
    vector <LL> fact(N + 5);
    fact[0] = 1;

    auto power = [&](int a, int b) -> int {
        LL res = 1;
        for ( ; b; b >>= 1, a = 1LL * a * a % P) {
            if (b & 1) {
                res = res * a % P;
            }
        }
        return res;
    };

    map <int, int> w;
    w[1] = 0;

    for (int i = 1; i <= N; i++) {
        fact[i] = fact[i - 1] * a % P;
        if (!w.count(fact[i])) {
            w[fact[i]] = i;
        }
    }

    vector <pair<int, int>> plan(n);
    for (int i = 0; i < n; i++) {
        auto &[u, v] = plan[i];
        cin >> u >> v;
        if (u > 0) {
            u = power(u, P - 2);
        }
    }

    while (q--) {
        int x;
        cin >> x;
        
        int ans = 0;
        for (auto &[st, day] : plan) {
            if (st == 0) {
                ans += (x == 0);
            } else {
                // st > 0
                int need = 1LL * x * st % P;
                if (w.count(need)) {
                    int to = w[need];
                    ans += (to <= day);
                }
            }
        }
        cout << ans << "\n";
    }
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}