/* ***********************************************
Author        :yang12138
Created Time  :2016/11/27 23:01:39
File Name     :1.cpp
************************************************ */

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int>P;

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];
bool vis[2][1000007];
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);
        vis[0][x[i]]=1;
        vis[1][y[i]]=1;
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
       int T;
    scanf("%d",&T);
    while(T--){
        mem(vis,0);
        Init();
        int l=0,r=0;
        for(int i=1;i<=n;i++) if(!vis[0][i]) l++;
        for(int i=1;i<=m;i++) if(!vis[1][i]) r++;
        printf("%d %d\n",l,r);
    }
    return 0;
}