int solve(int m[], int n[], int a, int b, int mMin, int mMax, int nMin, int nMax)
{
	if (n[b-1] <= m[a] <= n[b])
	{
		return n[b];
	}
	else if (m[a-1] <= n[b] <= m[a])
	{
		return m[a];
	}
	else if (m[a] < n[b-1])
	{
		mMin = a;
		a = mMin + ((mMax-mMin)/2);
		nMax = b;
		b = nMin + ((nMax-nMin)/2);
		return solve(m,n,a,b,mMin,mMax,nMin,nMax);
	}
	else if (n[b] < m[a-1])
	{
		mMax = a;
		a = mMax + ((mMax-mMin)/2);
		nMin = b;
		b = nMax + ((nMax-nMin)/2);
		return solve(m,n,a,b,mMin,mMax,nMin,nMax);
	}
}