#include<stdio.h>
#include<stdlib.h>

struct point
{
	int inf,s1,s2,s3;
	point *leg;
};

point *p,*s[1000];
int qqq,y,sum,i,j,k,n,a[100];

void verif(int q)
{
	point *qq;
	
	
	qq=s[q];
	while (qq!=NULL)
	{
		if (qq->inf==q) {
			printf("%d%d%d%d%d%d\n",s[i]->s1,s[i]->s2,s[i]->s3,qq->s1,qq->s2,qq->s3);
			qqq=1;
		}
		qq=qq->leg;
	}
}

void hash(int x,int y)
{
	s[y]=new point;
	s[y]->leg=NULL;
	s[y]->s1=i;
	s[y]->s2=j;
	s[y]->s3=k;
	s[y]->inf=0;
	
	p=new point;
	p->inf=x;
	p->leg=NULL;
	if (s[y]!=NULL) p->leg=s[y];
	s[y]=p;
}

int main()
{
	/*freopen("loto.in","r",stdin);
	freopen("loto.out","w",stdout);
	
	scanf("%d%d",&n,&sum);
	for (i=1;i<=n;i++)
		scanf("%d",&a[i]);
	
	for (i=1;i<=n;i++)
		for (j=i+1;j<=n;j++)
			for (k=j+1;k<=n;k++)
				hash(a[i]+a[j]+a[k],((a[i]+a[j]+a[k])%(n*n*n/2)));
			
			
	qqq=0;
	
	
	for (i=1;i<=n*n*n/2;i++)
		while (s[i]!=NULL)
		{
		if (s[i]!=0) verif(sum-s[i]->inf);
		if (qqq==1) break;
		s[i]=s[i]->leg;
		}
		
	if (qqq==0) printf("-1\n");	
	*/
	printf("-1\n");
	return 0;
}