#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve()
{
  long long n, x, y, a, b;
  cin >> n >> x >> y >> a >> b;
  long long s = x + y;
  if (s < 0 && s + a * (n - 1) < 0)
  {
    cout << x + a * n << ' ' << y << '\n';
    return;
  }
  if (s >= 0 && s - b * (n - 1) >= 0)
  {
    cout << x << ' ' << y - b * n << '\n';
    return;
  }
  if (a < 0)
  {
    long long cnt = min(n, s / b + 1);
    x += a * (n - cnt);
    y -= b * cnt;
    cout << x << ' ' << y << '\n';
    return;
  }
  if (b < 0)
  {
    long long cnt = min(n, (-s + a - 1) / a);
    x += a * cnt;
    y -= b * (n - cnt);
    cout << x << ' ' << y << '\n';
    return;
  }
  if (a > b)
  {
    int l = 0, r = n;
    while (r - l > 1)
    {
      long long mid = (l + r) / 2;
      long long tx = x + mid * a, ty = y - (n - mid) * b;
      long long ts = tx + ty;
      if (ts < -b) l = mid;
      else r = mid;
    }
    x += r * a;
    y -= (n - r) * b;
    cout << x << ' ' << y << '\n';
  }
  else if (a < b)
  {
    int l = 0, r = n;
    while (r - l > 1)
    {
      long long mid = (l + r) / 2;
      long long tx = x + mid * a, ty = y - (n - mid) * b;
      long long ts = tx + ty;
      if (ts >= a) r = mid;
      else l = mid;
    }
    x += l * a;
    y -= (n - l) * b;
    cout << x << ' ' << y << '\n';
  }
  else
  {
    if (s < 0)
    {
      long long cnt = min(n, (-s + a - 1) / a);
      n -= cnt;
      x += cnt * a;
    }
    else
    {
      long long cnt = min(n, (s + b) / b);
      n -= cnt;
      y -= cnt * b;
    }
    if (x + y < 0)
    {
      x += (n + 1) / 2 * a;
      y -= n / 2 * b;
    }
    else
    {
      x += n / 2 * a;
      y -= (n + 1) / 2 * b;
    }
    cout << x << ' ' << y << '\n';
  }
}

int main()
{
  int t;
  cin >> t;
  while (t--) solve();
}