#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
using ll = long long;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

bool isprime(int x){
  const int MAX_N = 1e6+10;
  static vector<bool> prime;
  if(prime.empty()){
    prime.resize(MAX_N,true);
    prime[1] = false;
    rep(i,2,MAX_N){
      if(prime[i]){
        for(int j=i*2;j<MAX_N;j+=i){
          prime[j] = false;
        }
      }
    }
  }
  return prime[x];
}

pii func(int n,int m){
  static vvector<int> values;
  if(values.empty()){
    values.resize(1010,vector<int>(1010,-1));
    int mx = 1;
    int my = 0;
    int px = 505;
    int py = 505;
    int dis = 1;
    values[px][py] = 1;
    int cnt = 1;
    while(cnt<1e6+10){
      rep(j,dis){
        px += mx;
        py += my;
        values[px][py] = ++cnt;
      }
      int t = my;
      my = -mx;
      mx = t;
      rep(j,dis){
        px += mx;
        py += my;
        values[px][py] = ++cnt;
      }
      t = my;
      my = -mx;
      mx = t;
      ++dis;
    }
  }
  vvector<pii> dp(1010,vector<pii>(1010,pii(-1,-1)));
  function<pii(int,int)> func =
    [&](int x,int y){
      if(values[x][y]==-1 or values[x][y]>m)return pii(0,0);
      if(dp[x][y].first!=-1)return dp[x][y];
      pii res(0,0);
      rep(nx,x-1,x+2){
        if(values[nx][y+1]==-1 or values[nx][y+1]>m)continue;
        pii d = func(nx,y+1);
        if(res.first<d.first){
          res = d;
        }
        if(res.first==d.first and res.second < d.second){
          res = d;
        }
      }
      if(isprime(values[x][y])){
        if(res.second==0){
          res.second = values[x][y];
        }
        ++res.first;
      }
      return dp[x][y] = res;
    };

  rep(i,1010){
    rep(j,1010){
      if(values[i][j]==n){
        return func(i,j);
      }
    }
  }
  return pii(0,0);
}

int main(){
  int m;
  int n;
  while(m=in()){
    n=in();
    pii ans = func(n,m);
    cout << ans.first << " " << ans.second << endl;
  }
  return 0;
}



Measured memory_bytes: 14952