#include <bits/stdc++.h>
#define MULTI \
    int _;    \
    cin >> _; \
    while (_--)
#define fi first
#define se second
#define pb(a) push_back(a)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n, m) for (int i = n; i <= m; i++)
#define repsv(i, n, m) for (int i = n; i >= m; i--)
#define vsz(a) (int)(a.size())
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()

using namespace std;

typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;

#ifdef LOCAL
#include "debugs.hpp"
#else
#define dbg(...) 0
#endif

void affiche(int a, int b, int c){
    cout << a << ' ' << b << ' ' << c << '\n';
}

void solve()
{
    vi q(6);
    vector<string> reqs = {
        "1 0 0",
        "0 1 0",
        "0 0 1",
        "1 1 1",
        "1 2 3"
    };
    rep(i, 5){
        cout << reqs[i] << '\n';
        fflush(stdout);
        cin >> q[i+1];
    }
    if(q[1]+q[2]+q[3] == q[4])
        affiche(q[1], q[2], q[3]);
    else if(q[1] + 2*q[2] + 3*q[3] == q[5])
        affiche(q[1], q[2], q[3]);
    else if(2*q[1] + q[2] + q[5] == 3*q[4])
        affiche(q[1], q[2], q[4]-q[2]-q[1]);
    else if(q[1]-q[3]+q[5] == 2*q[4])
        affiche(q[1], q[4]-q[1]-q[3], q[3]);
    else
        affiche(q[4]-q[2]-q[3], q[2], q[3]);
}

int main()
{
    ios_base::sync_with_stdio(false);
    // MULTI
    solve();
}