#include <bits/stdc++.h>

using namespace std;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = i64(1e18)+MOD;

template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

template <typename T = i64>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template <typename T = i64>
bool chmin(T& a, T b){
    if(a > b){
        a = b;
        return true;
    }
    return false;
}

#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;

#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);

void _dump(int, string& x){
    clog << x << endl;
}

template <typename T>
void _dump(bool, T& x){
    clog << x << " ";
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){

    for(auto& elm : x)
        _dump(0, elm);

    clog << endl;
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}


bool solve(){

    int n, m;
    input(m, n);
    if(!m)
        return false;

    auto eratosthenes = []{
        constexpr int N = 1e6+5;
        bitset<N> not_prime(3);
        for(int i = 2; i < N; ++i)
            if(!not_prime[i])
                for(int j = 2 * i; j < N; j += i)
                    not_prime.set(j);
        return not_prime;
    };

    static auto prime(eratosthenes().flip());

    vector<pair<pair<int,int>, int>> s;
    int x = 0, y = 0, d = 0;
    int sx = 0, ex = 0, sy = 0, ey = 0;
    vector<int> dx{1, 0, -1, 0};
    vector<int> dy{0, -1, 0, 1};
    int p = 1000;
    int q = p / 2;
    int h = p, w = p;
    vector<vector<int>> v(h, vector<int>(w, 0));
    int tx, ty;
    for(int i = 1; i <= m; ++i){
        if(i != 1){
            x += dx[d];
            y += dy[d];
        }
        if(prime[i])
            v[y + q][x + q] = i;
        if(i == n){
            tx = y + q;
            ty = x + q;
        }
        if(ex < x)
            ++ex, ++d;
        else if(x < sx)
            --sx, ++d;
        else if(ey < y)
            ++ey, d = 0;
        else if(y < sy)
            --sy, ++d;
    }

    vector<vector<int>> dp(h, vector<int>(w, -MOD));
    dp[tx][ty] = bool(v[tx][ty]);
    pair<int, int> ans{0, 0};
    for(int i = 0; i < h; ++i){
        for(int j = 0; j < w; ++j){
            if(dp[i][j] == -MOD)
                continue;
            if(v[i][j])
                chmax(ans, make_pair(dp[i][j], v[i][j]));
            if(i == h - 1)
                continue;
            if(j != w - 1)
                chmax(dp[i + 1][j + 1], dp[i][j] + bool(v[i + 1][j + 1]));
            if(j)
                chmax(dp[i + 1][j - 1], dp[i][j] + bool(v[i + 1][j - 1]));
            chmax(dp[i + 1][j], dp[i][j] + bool(v[i + 1][j]));
        }
    }

    cout << ans.first << " " << ans.second << endl;

    return true;
}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    while(solve());

}



Measured memory_bytes: 10988