#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>

using namespace std;

#define all( v )        begin( v ), end( v )
#define rep( i, j )     for ( int i = 0; i < (int)j; ++i )
#define rep2( i, j, k ) for ( int i = j; i <= (int)k; ++i )
#define rep3( i, j, k ) for ( int i = j; i >= (int)k; --i )

template < class S, class T > inline bool chmax( S& x, T y ) {
  if ( x < y ) {
    x = y;
    return true;
  }
  return false;
}

template < class S, class T > inline bool chmin( S& x, T y ) {
  if ( x > y ) {
    x = y;
    return true;
  }
  return false;
}
template < class T > struct edge {
  int from, to;
  T cost;

  edge( int to = 0 ) : from( -1 ), to( to ), cost( 0 ) { };
  edge( int to, T cost ) : from( -1 ), to( to ), cost( cost ) { }
  edge( int from, int to, T cost ) : from( from ), to( to ), cost( cost ) { }

  edge& operator=( const int& x ) {
    to = x;
    return *this;
  }
};

template < class T > using pq    = priority_queue< T >;
template < class T > using pqg   = priority_queue< T, vector< T >, greater< T > >;
template < class T > using Edges = vector< edge< T > >;
template < class T > using Graph = vector< Edges< T > >;

using ld  = long double;
using ll  = long long;
using pi  = pair< int, int >;
using pl  = pair< ll, ll >;
using vi  = vector< int >;
using vl  = vector< ll >;
using vpi = vector< pi >;
using vpl = vector< pl >;
using vvi = vector< vi >;
using vvl = vector< vl >;

const ll INFLL = 100000000000000000;
const ll INF   = 1000000000;
const ll MAX   = 500005;
const ll MOD   = 1000000007;
// const ll MOD = 998244353;

int main( void ) {
  ios::sync_with_stdio( 0 );
  cin.tie( 0 );
  cout << fixed << setprecision( 15 );

  int n;
  cin >> n;

  rep( i, n ) {
    string s[4];
    rep( j, 4 ) cin >> s[j];

    s[2] = to_string( stol( s[2] ) + 1 );

    rep( j, 4 ) cout << s[j] << " \n"[j == 3];
  }

  return ( 0 );
}