#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
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);
}

bool fx[1000006], fy[1000006];
int main()
{
    int t, cntx, cnty;
    scanf("%d", &t);
    while(t--){
        //scanf("%d%d%d%d", &n, &m, &k, &seed);
        Init();
        cntx = n;
        cnty = m;
        memset(fx, 0, sizeof(fx));
        memset(fy, 0, sizeof(fy));
        for(int i = 1; i <= k; i++){
            if(!fx[x[i]]){
                fx[x[i]] = 1;
                cntx--;
            }
            if(!fy[y[i]]){
                fy[y[i]] = 1;
                cnty--;
            }
        }
        printf("%d %d\n", cntx, cnty);
    }
    return 0;
}