#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<VL> VVL;
typedef long long LL;
#define all(a) (a).begin(), (a).end()
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define ALL(a)  (a).begin(),(a).end()
#define pb push_back

void las(LL p,LL q){
  LL x=p+q;
  x/=2;
  cout<<x<<' '<<p-x<<endl;
}

void f(LL n,LL x,LL y,LL a,LL b,int mod){
  //cout<<n<<x<<y<<mod<<endl;
  if(mod<=2){
   if(x+y>=0){
       if(b<=0){
         //las(x+y-b*n,x-y+b*n);return;
         cout<<x<<' '<<y-b*n<<endl;
         return;
       }
       LL m=(x+y)/b+1;
      if(m>=n){cout<<x<<' '<<y-b*n<<endl;return;}
       LL p=x+y-b*m,q=x-y+b*m;
      f(n-m,x,y-b*m,a,b,mod+1);
    }
    else{
      if(a<=0){
        cout<<x+a*n<<' '<<y<<endl;return;
      }
      LL m=-(x+y);
      m--; m/=a;m++;
      if(m>=n){cout<<x+a*n<<' '<<y<<endl;return;}
      LL p=x+y+a*m,q=x-y-a*m;
      f(n-m,x+a*m,y,a,b,mod+1);
    }
  }
  else{
    //cout<<"!"<<n<<x<<y<<a<<b<<endl;
      LL m=x+y-n*b;
      LL p=-b-m;
      p=(p+a+b-1)/(a+b);
      LL q=n-p;
      //cout<<p<<q<<endl;
      //las(x+y+a*p-b*q,x-y-a*p+b*q);
      cout<<x+a*p<<' '<<y-b*q<<endl;
      return;
  }
}

void sol(){
  LL n,x,y,a,b;
  cin>>n>>x>>y>>a>>b;
  f(n,x,y,a,b,0);
}

int main() {std::ios_base::sync_with_stdio(false);   std::cin.tie(NULL);
  int t;cin>>t;
  rep(i,t){sol();}
}