#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <iostream>
#include <stack>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
//#include <bits/stdc++.h>
//#define LOACL
#define MAX 30
#define space " "
using namespace std;
typedef long long LL;
//typedef __int64 Int;
typedef pair<int, int> paii;
const int INF = 0x3f3f3f3f;
const double ESP = 1e-5;
const double PI = acos(-1.0);
const int _K=50268147,_B=6082187,_P=100000007;
const int MAXN = 1000000 + 10;
bool fx[MAXN], fy[MAXN];
int _X;
inline int get_rand(int _l,int _r){
    _X=((long long)_K*_X+_B)%_P;
    return _X%(_r-_l+1)+_l;
}
int n,m,k,seed;
int x[1000006],y[1000006];
void Init(){
    scanf("%d%d%d%d",&n,&m,&k,&seed);
    _X=seed;
    for (int i=1;i<=k;++i)
        x[i]=get_rand(1,n),
        y[i]=get_rand(1,m);
}
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        Init();
        memset(fx, false, sizeof(fx));
        memset(fy, false, sizeof(fy));
        int ansy = 0; int  ansx = 0;
        for (int i = 1; i <= k; i++) {
            fx[x[i]] = fy[y[i]] = true;
        }
        for (int i = 1; i <= n; i++) {
            if (!fx[i]) ansx++;
        }
        for (int i = 1; i <= m; i++) {
            if (!fy[i]) ansy++;
        }
        printf("%d %d\n", ansx, ansy);
    }
    return 0;
}