/**
 *  Exploring Caves (Problem A, Japan Domestic, 2002-10-02)
 *  by Kenji Inoue, 2006-12-21
 **/

#include <iostream>

using namespace std;

int main() {
  int N;
  cin >> N;

  while (N--) {
    int cx=0, cy=0; // current (x, y) coordinates

    int dx, dy;
    int max=0, mx=0, my=0;
    while (cin >> dx >> dy, (dx || dy)) {
      cx += dx; cy += dy;

      int d = cx*cx + cy*cy;
      if ( d > max || (d == max && cx > mx) ) {
        max = d;
        mx = cx; my = cy;
      }
    }
    cout << mx << " " << my << endl;
  }

  return 0;
}