#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>

using namespace std;

typedef long long LL;

const int _K=50268147,_B=6082187,_P=100000007;
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 T;
bool f1[1000005],f2[1000005];
int ans1,ans2;
int main()
{    
    scanf("%d",&T);
    while (T--)
    {
        Init();        
        memset(f1,false,sizeof(f1));
        memset(f2,false,sizeof(f2));
        for (int i=1;i<=k;++i) f1[x[i]]=true,f2[y[i]]=true;
        ans1=ans2=0;
        for (int i=1;i<=n;++i) if (!f1[i]) ans1++;
        for (int i=1;i<=m;++i) if (!f2[i]) ans2++;
        printf("%d %d\n",ans1,ans2);
    }
    return 0;
}