import java.io.*;
import java.util.*;

/****
 *
 *	Stephen Fulwider
 *	BHCSI - 2007
 *	Knight
 *
 *	This is the algorithm to solve the knight's tour--it is a classic computer
 *	science problem that can be easily solved via backtracking
 *
 ****/

public class knight
{
	boolean[][] visited;
	int m,n;
	boolean firstRun;
	
	public knight(int mIn, int nIn)
	{
		m = mIn;
		n = nIn;
		visited = new boolean[m][n];
		firstRun = true;
	}
	
	public boolean solve(int r, int c)
	{
		/* if out of bounds */
		if (r<0 || r>=m || c<0 || c>=n)
			return false;
		
		/* if back to starting spot and tour is complete, return true */
		if (r==0 && c==0 && !firstRun)
		{
			if (tourComplete())
				return true;
			return false;
		}
		
		/* just to make sure we don't think we're back to parking lot on first run */
		firstRun = false;
			
		/* if already visited, don't increment */
		if (visited[r][c])
			return false;
			
		visited[r][c] = true;
		
		/* try surrounding 8 spots -- if any solve problem, return true */
		if (solve(r-2,c-1) || solve(r-2,c+1) || solve(r-1,c-2) || solve(r-1,c+2) ||
			 solve(r+1,c-2) || solve(r+1,c+2) || solve(r+2,c-1) || solve(r+2,c+1))
			 	return true;
		
		/* backtrack */
		visited[r][c] = false;
		return false;
	}
	
	/* tells whether a tour has been completed */
	private boolean tourComplete()
	{
		for (int i=0; i<m; i++)
			for (int j=0; j<n; j++)
				if (!visited[i][j])
					return false;
		return true;
	}
	
	/* main to get it all going */
	public static void main(String[] args) throws Exception
	{
		Scanner fIn = new Scanner(new File("knight.in"));
		int mIn = fIn.nextInt();
		int nIn = fIn.nextInt();
		int testCase = 1;
		while (!(mIn == 0 && nIn == 0))
		{
			knight tour = new knight(mIn,nIn);
			System.out.print("Campus Tour " + testCase++ + ": ");
			
			/* make sure to test for trivial case 1x1 board */
			if (tour.solve(0,0) || (mIn==1 && nIn==1))
				System.out.println("Congratulations, you can tour our campus!");
			else
				System.out.println("Sorry, you can't tour our campus!");
			
			/* get next data set */
			mIn = fIn.nextInt();
			nIn = fIn.nextInt();
		}
		fIn.close();
	}
}