#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

inline char nc() {
#define SIZE 1000003
    static char buf[SIZE], *p1 = buf + SIZE, *p2 = buf + SIZE;

    if (p1 == p2) {
        p1 = buf;
        p2 = buf + fread(buf, 1, SIZE, stdin);

        if (p1 == p2)
            return -1;
    }

    return *p1++;
}

template <typename T>
inline void read(T &x) {
    x = 0;
    char ch = nc();
    bool flag = 0;

    while (!isdigit(ch)) {
        if (ch == '-')
            flag = 1;

        ch = nc();
    }

    while (isdigit(ch)) {
        x = (x << 1) + (x << 3) + (ch^'0');
        ch = nc();
    }

    if (flag)
        x = -x;
}

unsigned int SA, SB, SC;
int p, A, B;
unsigned int rng61() {
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}

int n, m, k;
const int MAXN = 2048 + 5;
const int MAXM = 1e7 + 5;
int ta[MAXM], tb[MAXM], mx[MAXN];
LL w[MAXN][205], s[MAXN][205];
LL f[MAXN][205];

void gen() {
    read(n);
    read(k);
    read(m);
    read(p);
    read(SA);
    read(SB);
    read(SC);
    read(A);
    read(B);
    ++k;
    FOR(i, 1, p) read(ta[i]), read(tb[i]);
    FOR(i, p + 1, n) ta[i] = rng61() % A + 1, tb[i] = rng61() % B + 1;
    FOR(i, 1, (1 << k) - 1) FOR(j, 0, m - 1) w[i][j] = s[i][j] = 0;
    FOR(i, 1, n) {
        int x = i;

        while (x >= (1 << k))
            x >>= k;

        s[x][ta[i] % m] += tb[i];
    }
    FOR(i, 1, (1 << k) - 1) {
        FOR(j, 0, m - 1) {
            FOR(k, 0, m - 1) {
                w[i][j] += 1ll * s[i][k] * ((j - k + m) % m);
            }
        }
    }
}

inline void dfs(int v) {
    FOR(i, 0, m - 1) f[v][i] = 1e18;

    if ((v << 1) >= (1 << k)) {
        FOR(i, 0, m - 1) f[v][(m - i) % m] = w[v][i];
        return;
    }

    dfs(v << 1);
    dfs(v << 1 | 1);
    FOR(i, 0, m - 1) {
        FOR(j, 0, m - 1) {
            f[v][i] = std::min(f[v][i], f[v << 1][(i + j) % m] + f[v << 1 | 1][(i + j) % m] + w[v][j]);
        }
    }
}

inline void Solve() {
    gen();
    dfs(1);
    printf("%lld\n", f[1][0]);
}

int main() {
    int T;
    read(T);

    while (T--)
        Solve();

    return 0;
}