#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (bit & (1LL << i))

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;
template<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

// nまでの素数のリストを作成(nを含む) O(N log log N)
vector<bool> make_prime_list(int n) {
    vector<bool> is_prime(n + 1, true);
    is_prime[0] = false;
    is_prime[1] = false;

    vector<int> prime_list;
    for (int i = 2; i < n + 1; ++i) {
        if (!is_prime[i]) { continue; }
        prime_list.emplace_back(i);

        for (int j = i + i; j < n + 1; j += i) {
            is_prime[j] = false;
        }
    }
    return is_prime;  // すべての数値について素数かどうか
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    V<bool> is_prime = make_prime_list(1000010);

    V<pair<int, int>> pos(1100000);
    VV<int> f(1010, V<int>(1010, 0));
    {
        int y = 500, x = 500;
        int no = 1;
        int mode = 0;
        int num = 0;
        while (no < 1000010) {
            FOR(i, 0, num / 2 + 1) {
                pos[no] = make_pair(y, x);
                f.at(y).at(x) = no++;
                y += dy4[mode];
                x += dx4[mode];
            }
            mode = (mode + 1) % 4;
            num++;
        }
    }
    while (true) {
        int M, N;
        cin >> M >> N;
        if (M + N == 0) {
            break;
        }

        int ans1 = 0, ans2 = 0;
        queue<pair<int, int>> que;
        que.emplace(pos[N]);
        VV<int> dp(f.size(), V<int>(f[0].size(), -1));
        if (is_prime[f[pos[N].first][pos[N].second]]) {
            dp[pos[N].first][pos[N].second] = 1;
            ans1 = 1;
            ans2 = N;
        }
        else {
            dp[pos[N].first][pos[N].second] = 0;
        }

        while (not que.empty()) {
            int y = que.front().first;
            int x = que.front().second;
            que.pop();

            for(int i = -1; i <= 1; ++i) {
                if (not inside(y + 1, x + i, (int)f.size(), (int)f[0].size())) {
                    continue;
                }

                int no = f[y + 1][x + i];
                int d = is_prime[f[y + 1][x + i]];
                if (no <= M and dp[y + 1][x + i] < dp[y][x] + d) {
                    que.emplace(make_pair(y + 1, x + i));
                    dp[y + 1][x + i] = dp[y][x] + d;

                    if (d and dp[y + 1][x + i] > ans1) {
                        ans1 = dp[y + 1][x + i];
                        ans2 = no;
                    }
                    if (d and dp[y + 1][x + i] == ans1) {
                        chmax(ans2, no);
                    }
                }
            }
        }
        cout << ans1 << " " << ans2 << endl;
    }

    return 0;
}


Measured memory_bytes: 19580