/*
TASK:notalike
LANG:C++
*/
#include<iostream>
using namespace std;
int HASH[1001][21][21][21];
int f(int n, int p, int q, int pr){
	int res=0,i;
		//for first move pr=0
	if(n<p) return 0;
	if(HASH[n][p][q][pr]!=200) return HASH[n][p][q][pr];
	for(i=p;i<=q;i++)
		if((i!=pr)&&(n-i>=0)&&(!f(n-i,p,q,i))) res=i;
	
	HASH[n][p][q][pr]=res;
	return res;
}
int main(){
    char ch;
	int n1,p1,q1,n2,p2,q2,i,j,k,l;
	for(i=0;i<=1000;i++)
	for(j=0;j<=20;j++)
	for(k=0;k<=20;k++)
	for(l=0;l<=20;l++)
	HASH[i][j][k][l]=200;
	
	cin>>n1>>p1>>q1>>n2>>p2>>q2;
	cout<<f(n1,p1,q1,0)<<endl<<f(n2,p2,q2,0)<<endl;
	cin>>ch;
	return 0;
}
