#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define YES cout<<"Yes\n"
#define NO cout<<"No\n"
#define YN {cout<<"Yes\n";}else{cout<<"No\n";}// if(a==b)YN;
#define NO2 cout<<"-1\n"

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i=int(n)-1; i>=0; --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

void solve() {
    ll N,X,Y,A,B;
    cin >> N >> X >> Y >> A >> B;

    if (0<A) {
        if (0<B) {
            if (X+A*N+Y < 0) {
                cout << X+A*N << ' ' << Y << endl;
                return;
            }
            else if (X+Y-B*N >= 0) {
                cout << X << ' ' << Y-B*N << endl;
                return;
            }
            
            // else
            ll left=0, right=N;
            while(right-left>1) {
                ll mid = (left+right)/2;
                if (X+A*mid+Y-B*(N-mid) < -B) left=mid;
                else right=mid;
            }
            cout << X + A*right << ' ' << Y - B*(N-right) << endl;
        }
        else if (B==0) {
            if (X+Y >= 0) cout << X << ' ' << Y << endl;
            else cout << X-A*N << ' ' << Y << endl;
        }
        else {
            //(B<0)
            if (X+Y >= 0) cout << X << ' ' << Y-B*N << endl;
            else {
                ll k = (-X-Y+A-1)/A;
                cout << X+A*k << ' ' << Y-B*(N-k) << endl;
            }
        }
    }

    else {
        //(A<0)
        if (X+Y < 0) {
            cout << X+A*N << ' ' << Y << endl;
            return;
        }

        // X+Y>=0
        if (0<B) {
            ll k = (X+Y+B-1)/B;
            cout << X+A*(N-k) << ' ' << Y-B*k << endl;
        }
        else if (B==0) {
            cout << X << ' ' << Y << endl;
        }
        else {
            //(B<0)
            cout << X << ' ' << Y-B*N << endl;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T--) {
        solve();
    }
}