#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,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	vector<vi> candidates;
	rep(a, 10) rep(b, 10) rep(c, 10) rep(d, 10) {
		if(a == b || a == c || a == d || b == c || b == d || c == d)
			continue;
		candidates.push_back(vi{ {a, b, c, d} });
	}
	while(1) {
		vi a = candidates[rand() % candidates.size()];
		printf("%d %d %d %d\n", a[0], a[1], a[2], a[3]);
		fflush(stdout);
		int X; int Y;
		scanf("%d%d", &X, &Y);
		if(X == 4)
			break;
		vector<vi> ncs;
		int maska = 0;
		rep(k, 4) maska |= 1 << a[k];
		for(const vi &v : candidates) {
			int x = 0, y = 0;
			rep(k, 4) {
				x += a[k] == v[k];
				y += (maska >> v[k] & 1) && a[k] != v[k];
			}
			if(x == X && y == Y)
				ncs.push_back(v);
		}
		candidates.swap(ncs);
	}
	return 0;
}