Prime Path

The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.  
— It is a matter of security to change such things every now and then, to keep the enemy in the dark.  
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!  
— I know, so therefore your new number 8179 is also a prime. You will just have to paste four new digits over the four old ones on your office door.  
— No, it’s not that simple. Suppose that I change the first digit to an 8, then the number will read 8033 which is not a prime!  
— I see, being the prime minister you cannot stand having a non-prime number on your door even for a few seconds.  
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers where only one digit is changed from one prime to the next prime.  

Now, the minister of finance, who had been eavesdropping, intervened.  
— No unnecessary expenditure, please! I happen to know that the price of a digit is one pound.  
— Hmm, in that case I need a computer program to minimize the cost. You don't know some very cheap software gurus, do you?  
— In fact, I do. You see, there is this programming contest going on... Help the prime minister to find the cheapest prime path between any two given four-digit primes! The first digit must be nonzero, of course. Here is a solution in the case above.  

1033  
1733  
3733  
3739  
3779  
8779  
8179

The cost of this solution is 6 pounds. Note that the digit 1 which got pasted over in step 2 can not be reused in the last step – a new 1 must be purchased.

Input

One line with a positive number: the number of test cases (at most 100). Then for each test case, one line with two numbers separated by a blank. Both numbers are four-digit primes (without leading zeros).

Output

One line for each case, either with a number stating the minimal cost or containing the word Impossible.

Sample Input

3
1033 8179
1373 8017
1033 1033

Sample Output

6
7
0

给出两个素数你n,m，求经过多少次变化能从n变到m;每一次变化只能变化一位数字，且变化完的4位数也是素数

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
using namespace std;
const int maxn = 10005;
const int INF = 0x3f3f3f3f;
int a[maxn];
int vis[maxn];
int n, m;
struct node
{
	int x, step;
};
bool judge_prim(int x)
{
	if (x == 0 || x == 1)
		return false;
	else if (x == 2 || x == 3)
		return true;
	else
	{
		for (int i = 2; i <= (int)sqrt(x); i++)
			if (x%i == 0)
				return false;
		return true;
	}

}
void bfs(int x)
{
	memset(vis, 0, sizeof(vis));
	queue<node>q;
	node a,c;
	a.x = x;
	a.step = 0;
	q.push(a);
	vis[a.x] = 1;
	while (!q.empty())
	{
		node b = q.front();
		q.pop();
		if (b.x == m)
		{
			printf("%d\n", b.step);
			return;
		}
		for (int i = 1; i <= 9; i+=2)
		{
			c.x = b.x / 10 * 10 + i;
			if (!vis[c.x] && c.x != b.x&&judge_prim(c.x))
			{
				vis[c.x] = 1;
				c.step = b.step + 1;
				q.push(c);
			}
		}
		for (int i = 0; i <= 9; i++)
		{
			c.x = b.x / 100 * 100 + i * 10 + b.x % 10;
			if (!vis[c.x] && c.x != b.x&&judge_prim(c.x))
			{
				vis[c.x] = 1;
				c.step = b.step + 1;
				q.push(c);
			}
		}
		for (int i = 0; i <= 9; i++)
		{
			c.x = b.x / 1000 * 1000 + i * 100 + b.x % 100;
			if (!vis[c.x] && c.x != b.x&&judge_prim(c.x))
			{
				vis[c.x] = 1;
				c.step = b.step + 1;
				q.push(c);
			}
		}
		for (int i = 1; i <= 9; i++)
		{
			c.x = i * 1000 + b.x % 1000;
			if (!vis[c.x] && c.x != b.x&&judge_prim(c.x))
			{
				vis[c.x] = 1;
				c.step = b.step + 1;
				q.push(c);
			}
		}
	}
	printf("Impossible\n");
	return;
}
int main()
{
	int t;
	scanf_s("%d", &t);
	while (t--)
	{
		scanf_s("%d%d", &n, &m);
		bfs(n);
	}
}