Problem: Prime Caves

An international expedition discovered abandoned Buddhist cave temples in a giant cliff standing on the middle of a desert. There were many small caves dug into halfway down the vertical cliff, which were aligned on square grids. The archaeologists in the expedition were excited by Buddha's statues in those caves. More excitingly, there were scrolls of Buddhism sutras (holy books) hidden in some of the caves. Those scrolls, which estimated to be written more than thousand years ago, were of immeasurable value.

The leader of the expedition wanted to collect as many scrolls as possible. However, it was not easy to get into the caves as they were located in the middle of the cliff. The only way to enter a cave was to hang you from a helicopter. Once entered and explored a cave, you can climb down to one of the three caves under your cave; i.e., either the cave directly below your cave, the caves one left or right to the cave directly below your cave. This can be repeated for as many times as you want, and then you can descent down to the ground by using a long rope.

So you can explore several caves in one attempt. But which caves you should visit? By examining the results of the preliminary attempts, a mathematician member of the expedition discovered that (1) the caves can be numbered from the central one, spiraling out as shown in Figure D-1; and (2) only those caves with their cave numbers being prime (let's call such caves prime caves), which are circled in the figure, store scrolls. From the next attempt, you would be able to maximize the number of prime caves to explore.

<image>

Figure D-1: Numbering of the caves and the prime caves


Write a program, given the total number of the caves and the cave visited first, that finds the descending route containing the maximum number of prime caves.

Input

The input consists of multiple datasets. Each dataset has an integer m (1 ≤ m ≤ 106) and an integer n (1 ≤ n ≤ m) in one line, separated by a space. m represents the total number of caves. n represents the cave number of the cave from which you will start your exploration. The last dataset is followed by a line with two zeros.

Output

For each dataset, find the path that starts from the cave n and contains the largest number of prime caves, and output the number of the prime caves on the path and the last prime cave number on the path in one line, separated by a space. The cave n, explored first, is included in the caves on the path. If there is more than one such path, output for the path in which the last of the prime caves explored has the largest number among such paths. When there is no such path that explores prime caves, output "`0 0`" (without quotation marks).

Sample Input


49 22
46 37
42 23
945 561
1081 681
1056 452
1042 862
973 677
1000000 1000000
0 0


Output for the Sample Input


0 0
6 43
1 23
20 829
18 947
10 947
13 947
23 947
534 993541






Example

Input

49 22
46 37
42 23
945 561
1081 681
1056 452
1042 862
973 677
1000000 1000000
0 0


Output

0 0
6 43
1 23
20 829
18 947
10 947
13 947
23 947
534 993541

Solution (in CPP):

Solution:
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define MAX 1000005
int F[MAX]={1,1},i,j,p=0,N,M,C[1005][1005],pos[MAX][2],dp[MAX],t,nc;
typedef struct D{int c,np,now;}D;

void set(int n,int y,int x){C[y][x]=n;pos[n][0]=y;pos[n][1]=x;}

void vortex()
{
	int i,j,pre,nx,ny,mv[5]={-1,0,1,0,-1};
	memset(C,0x7f,sizeof(C));
	nx=1005/2;ny=1005/2;
	set(1,ny,nx++);
	set(2,ny,nx);
	for(i=3,pre=i-1;i<MAX;pre=i++)
	{
		for(j=0;j<4;j++)
		{
			if(C[ny+mv[j]][nx+mv[j+1]]==pre-1)
				break;
		}
		for(;C[ny+mv[j]][nx+mv[j+1]]<MAX;)
			j=(j+1)%4;
		ny+=mv[j];
		nx+=mv[j+1];
		set(i,ny,nx);
	}
}

int main()
{
	for(i=2;i<MAX;i++)
		if(!F[i])
		{
			for(j=i*2;j<MAX;j+=i)
				F[j]=1;
		}
	vortex();
	for(;scanf("%d%d",&M,&N),N+M;)
	{
		memset(dp,-1,sizeof(dp));
		queue<D>Q;
		D tmp={!F[N],(!F[N])?N:0,N},r=tmp;
		Q.push(tmp); 
		while(!Q.empty())
		{
			tmp=Q.front();Q.pop();
			if(r.c<tmp.c||(tmp.c==r.c&&tmp.np>r.np))
				r=tmp;
			if(tmp.c<dp[tmp.now])continue;
			dp[tmp.now]=tmp.c;
			for(i=-1;i<2;i++)
			{
				t=C[pos[tmp.now][0]+1][pos[tmp.now][1]+i];
				if(t>M)continue;
				nc=tmp.c+(!F[t]);
				if(dp[t]<nc)
				{
					D ins={nc,(!F[t])?t:tmp.np,t};
					dp[t]=ins.c;
					Q.push(ins);
				}
			}
		}
		printf("%d %d\n",r.c,r.np);
	}
	return 0;
}