#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<queue>
using namespace std;
typedef long long LL;
typedef pair<int,int>p1;
const int maxn=200005;
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 vis[maxn*5];
int use[maxn*5];
int main()
{
    
    int t;
    cin>>t;
    while(t--){
        Init();
        memset(vis,0,sizeof(vis));
        memset(use,0,sizeof(use));
        for(int i=1;i<=k;i++){
            vis[x[i]]=1;
            use[y[i]]=1;
        }
        int x=0;
        int y=0;
        for(int i=1;i<=n;i++){
            if(!vis[i]) x++;
        }
        for(int i=1;i<=m;i++){
            if(!use[i]) y++;
        }
        printf("%d %d\n",x,y);
    }
}