#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

// 素数列挙
const ll MAX_PRIME = 1000005;
vector<int> primes;
vector<int> is_prime(MAX_PRIME + 1,true);
void init_primes(){
    is_prime[0] = is_prime[1] = false;
    for(int i = 2; i <= MAX_PRIME;i++){
        if(is_prime[i]){
            primes.push_back(i);
            for(int j = i*2; j <= MAX_PRIME; j+=i) is_prime[j] = false;
        }
    }
}

int caves[1005][1005];
pii init_caves(int m,int n){
    int dx[4] = {1,0,-1,0};
    int dy[4] = {0,1,0,-1};
    
    pii ret_s;
    fill(*caves,*caves+1005*1005,0);
    
    int x = 500,y = 500;
    int k = 1;
    for(int i = 1; i <= m;i++){
        if(i == n) ret_s = pii(x,y);
        caves[x][y] = i;
        x += dx[k]; y += dy[k];
        
        int nk = (k+1)%4;
        int tx = x + dx[nk];
        int ty = y + dy[nk];
        if(caves[tx][ty] == 0) k = nk;
    }
    
//    for(int i = 490; i <= 510; i++){
//        for(int j = 490; j <= 510;j++){
//            cout << caves[i][j] << " ";
//        }
//        cout << endl;
//    }
    return ret_s;
}

pii dp[1005][1005];
template<class Type>
Type solve(Type res = Type()){
    init_primes();
    
    int n,m;
    while(cin >> m >> n,n){
        auto s = init_caves(m, n);
        
        fill(*dp,*dp+1005*1005,pii(-1,-1));
        
        if(is_prime[n]){
            dp[s.first][s.second] = pii(1,n);
        }else{
            dp[s.first][s.second] = pii(0,0);
        }
        
        pii ans = pii(-1,-1);
        for(int x = 0; x <= 1000; x++){
            for(int y = 0; y <= 1000;y++){
                if(dp[x][y].first == -1) continue;
                ans = max(ans,dp[x][y]);
                for(int k = -1; k <= 1;k++){
                    pii happy = dp[x][y];
                    
                    int val = caves[x+1][y+k];
                    if(val == 0) continue;
                    
                    if(is_prime[val]){
                        happy.first++;
                        happy.second = val;
                    }
                    
                    dp[x+1][y+k] = max(dp[x+1][y+k],happy);
                }
            }
        }
        cout << ans.first << " " << ans.second << endl;
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    solve(0);
    // cout << fixed << setprecision(15) << solve<ll>() << endl;
    return 0;
}



Measured memory_bytes: 19056