A Knight's Journey

Background
The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey
around the world. Whenever a knight moves, it is two squares in one direction and one square perpendicular to this. The world of a knight is the chessboard he is living on. Our knight lives on a chessboard that has a smaller area than a regular 8 * 8 board, but it is still rectangular. Can you help this adventurous knight to make travel plans?


Problem
Find a path such that the knight visits every square once. The knight can start and end on any square of the board.
输入
The input begins with a positive integer n in the first line. The following lines contain n test cases. Each test case consists of a single line with two positive integers p and q, such that 1 <= p * q <= 26. This represents a p * q chessboard, where p describes how many different square numbers 1, . . . , p exist, q describes how many different square letters exist. These are the first q letters of the Latin alphabet: A, . . .
输出
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the lexicographically first path that visits all squares of the chessboard with knight moves followed by an empty line. The path should be given on a single line by concatenating the names of the visited squares. Each square name consists of a capital letter followed by a number.
If no such path exist, you should output impossible on a single line.
样例输入
3
1 1
2 3
4 3
样例输出
Scenario #1:
A1


Scenario #2:
impossible


Scenario #3:

A1B3C1A2B4C2A3B1C3A4B2C4

#include <iostream>
#include <cstring>
using namespace std;
int vis[27][27],x[1000],y[1000],L,D;
int dep=0,sign=0;
int dx[8]= {-1,1,-2,2,-2,2,-1,1},dy[8]= {-2,-2,-1,-1,1,1,2,2};
void dfs(int a,int b)
{
	if(sign) return;
	dep++;
	x[dep]=a;
	y[dep]=b;
	if(dep==L*D)
	{
		sign=1;
		return;
	}
	vis[a][b]=1;
		for(int j=0;j<8;j++)
		{
			int m=a+dx[j],n=b+dy[j];
			if(!vis[m][n]&&m>0&&m<=L&&n>0&&n<=D)
			{
				dfs(m,n);
				dep--;
			}
		}
	
	vis[a][b]=0;
}
int main()
{
	int n;
	cin>>n;
	for(int p=1; p<=n; p++)
		{
			dep=0;
			sign=0;
			memset(vis,0,sizeof(vis));
			cin>>L>>D;
			cout<<"Scenario #"<<p<<":"<<endl;
			dfs(1,1);
			if(sign)
				{
					for(int i=1; i<=L*D; i++)
						{
							printf("%c%d",y[i]+64,x[i]);
                            
						}
						cout<<endl;
				}
				else
				{
					cout<<"impossible"<<endl;
				}
				cout<<endl;
		}
	return 0;
}