SRM_176_Div2_250

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
int complem(int a){ return (255-a);}
int main() {
 int t,n,aux;vector<int> v;
 scanf("%d",&t);
 while(t--){
    scanf("%d",&n);
    for(int i=0;i<3;i++){
        scanf("%d",&aux);v.push_back(aux);
    }
    vector<int> comp;int cm;int cont=0;
    for(int i=0;i<v.size();i++){
        cm=complem(v[i]);/*complemento*/
        comp.push_back(cm);
        if(abs(v[i]-cm)<=32) cont++;
    }
    if(cont==v.size()){/*todos difieren en 32*/
      comp.clear();
      for(int i=0;i<v.size();i++){
        if(v[i]-128>=0) comp.push_back(v[i]-128);
        else comp.push_back(v[i]+128);
      }
    }
    cout<<n<<endl;
    for(int i=0;i<comp.size();i++){
        cout<<comp[i]<<endl;
    }
    v.clear();
 }
    return 0;
}