#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int N = 100010;
typedef long long ll;
typedef pair<int, int> pii;
std::mt19937 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

template <typename T>
void debug(T x) {
    cerr << x << '\n';
}

template <typename T, typename... Args>
void debug(T x, Args... args) {
    cerr << x << ' ';
    debug(args...);
}

// op1 
// sum = sum * 2 + ma * n;
// ma = ma * 2;
// n = n * 2;
int exgcd(ll a, ll b, ll &x, ll &y){
    if(b){
        ll d = exgcd(b, a % b, y, x);
        // gcd(b, a mod b) = gcd(a, b) = y * b + x * (a - b * a / b)
        y -= a / b * x;
        return d;
    }
    else{
        x = 1;
        y = 0;
        return a;
    }
}

void solve() {
    ll x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    ll x, y;
    exgcd(y1 - y2, -(x1 + x2), x, y);
    cout << x << ' ' << y << '\n';
}

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