#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


// std::vector Declaration
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...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl


struct edge { int to, cost; };
ostream& operator<<(ostream& os, const edge& e) {
    os << "(" << e.to << ", " << e.cost << ")";
    return os;
}

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

// O(NloglogN)
struct IsPrime {
    int sz;
    vector<bool> isprime;
    IsPrime(int n) : sz(n+1) {
        isprime.assign(n+1, true);
        isprime[0] = isprime[1] = false;
        for (int i = 2; i*i <= n; ++i) if (isprime[i]) {
            for (int j = 2; i*j <= n; ++j) {
                isprime[i*j] = false;
            }
        }
    }
    bool operator[](int i) { return isprime[i]; }
};

int main()
{
    vector<int> ms, ns;
    while (true) {
        int m, n; cin >> m >> n;
        if (m == 0 && n == 0) {
            break;
        }
        ms.push_back(m);
        ns.push_back(n);
    }

    for (int t = 0; t < ms.size(); ++t) {

        int m = ms[t], n = ns[t];

        IsPrime isprime(m);

        int K = (int)sqrt(m)/2+10;
        auto s = make_v<int>(2*K+10, 2*K+10);
        vector<pair<int,int>> ps(m+1);

        int c = 0;
        s[0+K][0+K] = ++c;

        bool terminal = false;
        for (int k = 1; !terminal; ++k) {
            for (int i = 0; !terminal && i < 2*k; ++i) {
                s[-i+k-1+K][k+K] = ++c;
                ps[c] = { -i+k-1, k };
                if (c == m) terminal = true;
            }
            for (int i = 0; !terminal && i < 2*k; ++i) {
                s[-k+K][-i+k-1+K] = ++c;
                ps[c] = { -k, -i+k-1 };
                if (c == m) terminal = true;
            }
            for (int i = 0; !terminal && i < 2*k; ++i) {
                s[i-k+1+K][-k+K] = ++c;
                ps[c] = { i-k+1, -k };
                if (c == m) terminal = true;
            }
            for (int i = 0; !terminal && i < 2*k; ++i) {
                s[k+K][i-k+1+K] = ++c;
                ps[c] = { k, i-k+1 };
                if (c == m) terminal = true;
            }
        }


        //for (int i = 0; i < s.size(); ++i) {
        //    for (int j = 0; j < s[i].size(); ++j) {
        //        printf("%4d ", s[i][j]);
        //    }
        //    printf("\n");
        //}
        //printf("\n");


        int x = ps[n].fs, y = ps[n].sc;

        auto dp = make_v<int>(2*K+10, 2*K+10);
        dp[x+K][y+K] = isprime[s[x+K][y+K]];

        int ma = dp[x+K][y+K];
        int fi = (ma ? s[x+K][y+K] : 0);

        for (int i = 0; x+i < K-1; ++i) {
            for (int j = -i; j <= i; ++j) {
                int X = x+i+K, Y = y+j+K;
                for (int a = -1; a <= 1; ++a) {
                    if (Y+a < 0 || Y+a >= 2*K) {
                        continue;
                    }
                    if (s[X+1][Y+a] == 0) {
                        continue;
                    }
                    chmax(dp[X+1][Y+a], dp[X][Y] + isprime[s[X+1][Y+a]]);
                    if (chmax(ma, dp[X+1][Y+a])) {
                        fi = -1;
                    }

                    if (ma == dp[X+1][Y+a] && isprime[s[X+1][Y+a]]) {
                        chmax(fi, s[X+1][Y+a]);
                    }
                }
            }
        }

        //for (int i = 0; i < dp.size(); ++i) {
        //    for (int j = 0; j < dp[i].size(); ++j) {
        //        printf("%02d ", dp[i][j]);
        //    }
        //    printf("\n");
        //}
        cout << ma << " " << fi << endl;
    }

    return 0;
}



Measured memory_bytes: 19192