#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define int long long 
#define rep(i, l, r) for (int i = l; i <= r; ++i)
struct node { int x, y; } a, b, c;
int T; 

void Exgcd (int a, int b, int &x, int &y) {
  if(!b) return x = 1, y = 0, void(); 
  Exgcd(b, a % b, y, x), y -= (a / b) * x; 
}

signed main () {
  ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0); 
  cin >> T;
  while (T--) {
    cin >> a.x >> a.y >> b.x >> b.y; 
    b.x -= a.x, b.y -= a.y; 
    if(b.x == 0) {
      c.x = 1, c.y = 0; 
    } else if(b.y == 0) {
      c.x = 0, c.y = 1; 
    } else Exgcd(b.x, -b.y, c.y, c.x); 
    cout << c.x + a.x << ' ' << c.y + a.y << '\n'; 
  }
  return 0; 
}