//#pragma GCC optimize ("O3","unroll-loops")
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cassert>

#include<cmath>
#include<functional>
#include<algorithm>
#include<numeric>

#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#include<bitset>
#include<tuple>

#define TEST {IS_TEST=true;}
#define fi first
#define se second
#define pb(x) emplace_back(x)
#define pf(x) emplace_front(x)
#define emp(x) emplace(x)
#define mp(x,y) make_pair(x,y)

using namespace std;
using ll = int_fast64_t;
using v_b = vector <bool>; using v_ll = vector <ll>; using str = string; using v_str = vector <string>; using p_ll = pair < ll,ll >;
using vv_b = vector < v_b >; using vv_ll = vector < v_ll >; using vp_ll = vector < p_ll >;
using vvv_ll = vector < vv_ll >; using vvp_ll = vector < vp_ll >;
using ld = long double; using v_ld = vector <ld>; using vv_ld = vector<v_ld>;

bool IS_TEST=false;
ll ll_min64=1LL<<63;
ll ll_max64=~ll_min64;
ll ll_min32=1LL<<31;
ll ll_max32=~ll_min32;

ll MOD = 1000000007;

/*displaying functions for debug*/
template<class T> void show2(const T &x){cerr << x;}
template<class T1,class T2> void show2(const pair<T1,T2> &x){
  cerr << "{" << show2(x.first) << "," << show2(x.second) << "}";
}
template<class T> void show(const T &x){
  if (!IS_TEST) return; show2(x); cerr << "\n";
}
template<class T> void v_show(const T &v, ll n=-1){
  if (!IS_TEST) return; auto itr=v.begin(); ll m=n;
  while(itr!=v.end() && m!=0 ){ show2(*itr); cerr << " "; itr++; m--;}
  cerr << "\n";
}
template<class T> void vv_show(const T &v, ll n=-1){
  if (!IS_TEST) return;
  cerr << "--------------------------------\n";
  auto itr=v.begin(); ll m=n;
  while(itr!=v.end() && m!=0 ){ v_show(*itr,n); itr++; m--;}
  cerr << "--------------------------------\n";
}
/*--------------------------------*/

/*loading integers*/
void load(ll& x1){ cin >> x1; }
void load(ll& x1,ll& x2){ cin >> x1 >> x2; }
void load(ll& x1,ll& x2,ll& x3){ cin >> x1 >> x2 >> x3; }
void load(ll& x1,ll& x2,ll& x3,ll& x4){ cin >> x1 >> x2 >> x3 >> x4; }
void v_load(ll n, v_ll& v1, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld",&v1[i+head]); }
}
void v_load(ll n, v_ll& v1 ,v_ll& v2, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init); v2.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld%lld",&v1[i+head],&v2[i+head]); }
}
void v_load(ll n, v_ll& v1 ,v_ll& v2, v_ll& v3, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init); v2.assign(m,init); v3.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld%lld%lld",&v1[i+head],&v2[i+head],&v3[i+head]); }
}
void v_load(ll n, v_ll& v1 ,v_ll& v2, v_ll& v3, v_ll& v4, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init); v2.assign(m,init); v3.assign(m,init); v4.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld%lld%lld%lld",&v1[i+head],&v2[i+head],&v3[i+head],&v4[i+head]); }
}
/*--------------------------------*/

v_ll local_sort(ll x1=ll_max64, ll x2=ll_max64, ll x3=ll_max64, ll x4=ll_max64){
    v_ll x{x1,x2,x3,x4};
    sort(x.begin(),x.end());
    return x;
}

ll max(ll x,ll y){return x>y?x:y;}
ll min(ll x,ll y){return x<y?x:y;}

ll max(v_ll::iterator b,v_ll::iterator e){
    ll ans=*b;
    while (b<e) {ans=max(ans,*b);b++;}
    return ans;
}
ll argmax(v_ll::iterator b,v_ll::iterator e){
    ll ans=0, cnt=0, val=*b;
    while (b<e) { if (val<*b) {ans=cnt; val=*b;} cnt++; b++;}
    return ans;
}
ll min(v_ll::iterator b,v_ll::iterator e){
    ll ans=*b;
    while (b<e) {ans=min(ans,*b);b++;}
    return ans;
}
ll argmin(v_ll::iterator b,v_ll::iterator e){
    ll ans=0, cnt=0, val=*b;
    while (b<e) { if (val>*b) {ans=cnt; val=*b;} cnt++; b++;}
    return ans;
}
ll sum(v_ll::iterator b,v_ll::iterator e){
    ll ans=0;
    while (b<e) {ans+=*b;b++;}
    return ans;
}

template<class T> bool chmax(T& x,const T& y){ if (x>=y) return false; x=y; return true;}
template<class T> bool chmin(T& x,const T& y){ if (x<=y) return false; x=y; return true;}

template<class T> void quit(T x){cout << x << endl; exit(0);}
void yesno(bool x){cout << (x?"Yes":"No") <<endl;}

ll rup(ll x,ll y){return (x-1)/y+1;}
ll rem(ll x,ll y){ ll z=x%y; return z>=0?z:z+y; }

template<typename T>
v_ll index_sort(const vector<T>& ref){
    v_ll idx(ref.size());
    iota(idx.begin(),idx.end(),0);
    sort(idx.begin(),idx.end(),[&](auto &x, auto &y){if (ref[x]<ref[y]) return true;});
}

//setprecision(digit)
//sort(##.begin(),##.end(),[&](auto &x, auto &y){if (x<y) return true;});
//ll ok=0,ng=0; while(abs(ok-ng)>1){ll mid=(ok+ng)/2; (true?ok:ng)=mid;}

struct dat{
    dat(){}
    bool operator < (const dat& rhs)const {return false; }
};

v_b furui(ll n){
    v_b v(n+1,true);
    v[0]=false;v[1]=false;
    for(ll i=2;i<=n;i++){
        if (v[i])
        for(ll j=i*2;j<=n;j+=i){
            v[j]=false;
        }
    }
    return v;
}

int main(){
    v_b isprime=furui(1000000);
    vv_ll V(1010,v_ll(1010,0));
    vvp_ll ans(1010,vp_ll(1010,mp(0,0)));
    while(true){
        ll N,M;
        cin >> M >> N;
        if (M==0&&N==0) break;
        ll cx=505,cy=505;
        ll x=cx,y=cy;
        
        ll idx=2;
        ll phase=0;
        ll bx=0,by=0;
        for(ll i=0;i<1010;i++){
            for(ll j=0;j<1010;j++){
                V[i][j]=0;
            }
        }
        for(ll i=0;i<1010;i++){
            for(ll j=0;j<1010;j++){
                ans[i][j]=mp(0,0);
            }
        }
        V[cy][cx]=1;
        while(idx<=M){
            for(ll i=0;i<phase*2+1;i++){
                if(idx>M) break;
                x++;
                V[y][x]=idx;
                if (idx==N){
                    bx=x;by=y;
                }
                idx++;
            }
            for(ll i=0;i<phase*2+1;i++){
                if(idx>M) break;
                y--;
                V[y][x]=idx;
                if (idx==N){
                    bx=x;by=y;
                }
                idx++;
            }
            for(ll i=0;i<phase*2+2;i++){
                if(idx>M) break;
                x--;
                V[y][x]=idx;
                if (idx==N){
                    bx=x;by=y;
                }
                idx++;
            }
            for(ll i=0;i<phase*2+2;i++){
                if(idx>M) break;
                y++;
                V[y][x]=idx;

                if (idx==N){
                    bx=x;by=y;
                }
                idx++;
            }
            phase++;
        }
/*
        for(ll i=500;i<=510;i++){
            for(ll j=500;j<=510;j++){
                cerr<< V[i][j] <<" ";
            }
            cerr<<endl;
        }*/
       p_ll a=mp(0,0);
        for(ll i=1008;i>=0;i--){
            for(ll j=1008;j>=1;j--){
                chmax(ans[i][j],ans[i+1][j-1]);
                chmax(ans[i][j],ans[i+1][j+0]);
                chmax(ans[i][j],ans[i+1][j+1]);
                if (isprime[V[i][j]]){
                    ans[i][j].fi++;
                    if (ans[i][j].se==0) ans[i][j].se=V[i][j];
                }
                if (V[i][j]==N) a=ans[i][j];
            }
        }
        cout << a.fi <<" "<<a.se<<"\n";
    }
}





Measured memory_bytes: 26744