#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
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[1000001],y[1000001];
bool xx[1000001], yy[1000001];
int main()
{
    int t;
    scanf ( "%d", &t );
    while ( t-- )
    {
        memset (xx, false, sizeof(xx) );
        memset ( yy, false , sizeof(yy) );
        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);
            xx[x[i]] = true;
            yy[y[i]] = true;
        }
        int sum = 0;
        int sum1 = 0;
        for ( int i = 1;i <= n; i++ )
        {
            if ( xx[i] == false )
                sum++;
        }
        for ( int i = 1;i <= m; i++ )
        {
            if ( yy[i] == false )
                sum1++;
        }
        printf ( "%d %d\n", sum, sum1 );
    }
}