#include <iostream>
#include <algorithm>
#include <set>
#include <utility>
#include <vector>
#include <array>
using namespace std;
 
int main() {
	const int NMAX = 3;                                                             
	typedef pair<int, set<int>> solution; 
	std::array<solution, NMAX*NMAX> memo;
	solution s;                                                                  
	s.first = -1;
	std::fill(std::begin(memo),std::end(memo), s);
 
	for (auto&& nextPair : memo)
	{
		std::cout << nextPair.first << " ";
	}
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c2V0PgojaW5jbHVkZSA8dXRpbGl0eT4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPGFycmF5Pgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7Cgljb25zdCBpbnQgTk1BWCA9IDM7ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIAoJdHlwZWRlZiBwYWlyPGludCwgc2V0PGludD4+IHNvbHV0aW9uOyAKCXN0ZDo6YXJyYXk8c29sdXRpb24sIE5NQVgqTk1BWD4gbWVtbzsKCXNvbHV0aW9uIHM7ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgCglzLmZpcnN0ID0gLTE7CglzdGQ6OmZpbGwoc3RkOjpiZWdpbihtZW1vKSxzdGQ6OmVuZChtZW1vKSwgcyk7CgoJZm9yIChhdXRvJiYgbmV4dFBhaXIgOiBtZW1vKQoJewoJCXN0ZDo6Y291dCA8PCBuZXh0UGFpci5maXJzdCA8PCAiICI7Cgl9CgoJcmV0dXJuIDA7Cn0=