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

using LL = long long;

int main() {

    int t;
    cin >> t;

    while (t--) {
        LL n, x, y, a, b;
        cin >> n >> x >> y >> a >> b;

        LL S = x + y;
        if (a > 0 && b > 0) {

            LL M = a + b;
            LL g = gcd(a, b);

            LL period = M / g;

            LL t0 = ((S + b) % M + M) % M;

            vector<LL> pref(period + 1, 0);

            LL cur = t0;

            for (LL i = 0; i < period; i++) {
                pref.at(i + 1) = pref.at(i) + (cur < b);
                cur += a;
                if (cur >= M) cur -= M;
            }

            LL full = n / period;
            LL rem = n % period;

            LL cntNeg = full * pref.at(period) + pref.at(rem);

            x += cntNeg * a;
            y -= (n - cntNeg) * b;
        }

        else if (a < 0 && b > 0) {

            LL k;

            if (S < 0) {
                k = 0;
            } else {
                k = S / b + 1;
                k = min<LL>(k, n);
            }

            y -= k * b;
            x += (n - k) * a;
        }

        else if (a > 0 && b < 0) {

            LL k;

            if (S >= 0) {
                k = 0;
            } else {
                k = (-S - 1) / a + 1;
                k = min<LL>(k, n);
            }

            x += k * a;
            y -= (n - k) * b;
        }

        else {

            if (S < 0) {
                x += n * a;
            } else {
                y -= n * b;
            }
        }

        cout << x << ' ' << y << '\n';
    }
}