#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using ll=long long;
using Pl=pair<ll,ll>;

namespace rgs = std::ranges;

void solve() {
    ll n,x,y,a,b;cin>>n>>x>>y>>a>>b;
    if (x+y>=0) {
        if (b<0) {
            y-=b*n;
            cout<<x<<" "<<y<<"\n";
            return;
        }
        ll cnt=(x+y+b-1)/b;
        if (cnt>=n) {
            y-=b*n;
            cout<<x<<" "<<y<<"\n";
            return;
        }
        y-=b*cnt;
        n-=cnt;
    }
    else if (x+y<0) {
        if (a<0) {
            x+=a*n;
            cout<<x<<" "<<y<<"\n";
            return;
        }
        ll cnt=(abs(x+y+a-1)/a);
        if (cnt>=n) {
            x+=a*n;
            cout<<x<<" "<<y<<"\n";
            return;
        }
        x+=a*cnt;
        n-=cnt;
    }
    if (a<0) {
        x+=a*n;
        cout<<x<<" "<<y<<"\n";
        return;
    }
    if (b<0) {
        y-=b*n;
        cout<<x<<" "<<y<<"\n";
        return;
    }
    if (abs(a)>abs(b)) {
        auto pr=[&](ll k) {
            ll s=(x+y)+a*k-b*(n-k);
            return s>-b;
        };
        ll ok=n;
        ll ng=-1;
        while (ok-ng>1) {
            ll cen=(ok+ng)/2;
            if (pr(cen)) {
                ok=cen;
            }
            else {
                ng=cen;
            }
        }
        x+=ok*a;
        y-=b*(n-ok);
        cout<<x<<" "<<y<<"\n";
        return;
    }
    auto pr=[&](ll k) {
        ll s=(x+y)+a*(n-k)-b*k;
        return s<a;
    };
    ll ok=n;
    ll ng=-1;
    while (ok-ng>1) {
        ll cen=(ok+ng)/2;
        if (pr(cen)) {
            ok=cen;
        }
        else {
            ng=cen;
        }
    }
    x+=(n-ok)*a;
    y-=b*ok;
    cout<<x<<" "<<y<<"\n";
    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll t=1;
    cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}