#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()


struct Edge {
    int to, cost, nm;
    Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

ll GCD(ll a, ll b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

bool prime[1000001];
int mas[1001][1001];
int dp1[1001][1001], dp2[1001][1001];
int dx[4] = { -1, 0, 1, 0 };
int dy[4] = { 0, 1, 0, -1 };
int main() {
    //cout << fixed << setprecision(15);
    
    prime[1] = false;
    for(int i=2; i<=1000000; ++i) prime[i]=true;
    
    for(int i=2; i*i<=1000000; ++i){
        if(prime[i]){
            for(int j=2; j*i<=1000000; ++j){
                prime[i*j] = false;
            }
        }
    }
    
    int n, m;
    while(cin >> n >> m, n||m){
        
        for(int i=0; i<1000; ++i){
            for(int j=0; j<1000; ++j){
                mas[i][j] = -1;
                dp1[i][j]=-1;
                dp2[i][j]=-1;
            }
        }
        int c = 2, d = 0, x = 499, y = 500;
        for(int i=1; i<=n; ++i){
            mas[y][x] = i; d++;
            x += dx[c % 4];
            y += dy[c % 4];
            if(d == c / 2){
                c++; d=0;
            }
        }
        int sx, sy;
        for(int i=0; i<1000; ++i){
            for(int j=0; j<1000; ++j){
                if(mas[i][j]==m) {
                    sx = j; sy = i;
                }
            }
        }
        if(prime[m]){
            dp1[sy][sx] = 1;
            dp2[sy][sx] = m;
        }else{
            dp1[sy][sx] = 0;
            dp2[sy][sx] = 0;
        }
        
        int res1 = dp1[sy][sx], res2 = dp2[sy][sx];
        
        for(int i=sy+1; i<1000; ++i){
            for(int j=0; j<1000; ++j){
                if(mas[i][j]!=-1){
                    int s1=-1, s2=-1;
                    for(int k=-1; k<=1; ++k){
                        if(j+k>=0 && j+k<1000){
                            if(dp1[i-1][j+k]!=-1){
                                if(prime[mas[i][j]]){
                                    s1 = max(s1, dp1[i-1][j+k]+1);
                                    s2 = mas[i][j];
                                }else{
                                    if(s1 < dp1[i-1][j+k]){
                                        s1 = dp1[i-1][j+k];
                                        s2 = dp2[i-1][j+k];
                                    }else if(s1 == dp1[i-1][j+k] && s2 < dp2[i-1][j+k]){
                                        s2 = dp2[i-1][j+k];
                                    }
                                }
                            }
                        }
                    }
                                 
                    dp1[i][j] = s1;
                    dp2[i][j] = s2;
                    
                    if(res1 < s1){
                        res1 = s1;
                        res2 = s2;
                    }else if(res1 == s1 && res2 < s2){
                        res2 = s2;
                    }
                }
            }
        }
        
        cout << res1 << " " << res2 << endl;
    }
    
    return 0;
}


Measured memory_bytes: 15788