#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not a)
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

// #define int ll
bool test = 0;
int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
#define MAX (int)1e6 + 5

ll pow(ll a, ll b) {
	ll i;
	ll ans = 1;
	rep(i, b) {
		ans *= a;
	}
	return ans;
}

signed main(void) {
	ll i, j, k, l;
	vector<string> ans_group;
	rep(i, 10000) {
		bool visited[10] = {};
		rep(j, 4) {
			ll j_node = (i % pow((ll)10, j + 1)) / pow((ll)10, j);
			if (visited[j_node]) break;
			visited[j_node] = true;
		}
		if (j != 4) continue;
		// printf("%04d\n",i);]
		char s[20];
		sprintf(s, "%04d", i);
		string str = s;
		ans_group.push_back(str);
	}
	// rep(i,ans_group.size()){
	// 	cout << ans_group[i] << endl;
	// }
	srand(time(NULL));
	while (ans_group.size() > 1) {
		// if (binary_search(ALL(ans_group), "1234")) cerr << "1234 found" << endl;
		// dump(ans_group.size());
		ll query_num = rand() % ans_group.size();
		string query = ans_group[query_num];
		ll x, y;
		rep(i, 3) cout << query[i] << " ";
		cout << query[i] << endl;
		cin >> x >> y;
		rep(i, ans_group.size()) {
			string target = ans_group[i];
			bool erase = false;
			ll cnt1 = 0, cnt2 = 0;
			rep(j, 4) {
				if (target[j] == query[j]) cnt1++;
			}
			if (cnt1 < x) erase = true;
			rep(j, 4) rep(k, 4) {
				if (target[j] == query[k]) {
					cnt2++;
					break;
				}
			}
			if (cnt2 < x + y) erase = true;

			if (erase) {
				ans_group.erase(ans_group.begin() + i);
				i--;
			}
		}
	}

	rep(i, 3) cout << ans_group[0][i] << " ";
	cout << ans_group[0][i] << endl;
	return 0;
}