#include <iostream>
#include <queue>

using namespace std;

int main(void)
{
    int n, k;
    cin >> n >> k;

    priority_queue<
        tuple<int, int, int>, 
        vector<tuple<int, int, int>>, 
        greater<tuple<int, int, int>>
            > pq;

    for (int a = 0; a <= n; a++) {
        pq.push(make_tuple(a*a + a*a, a, a));
    }

    for (int i = 0; i < k; i++) {
        auto [s, a, b] = pq.top(); pq.pop();
        pq.push(make_tuple(a*a + (b+1)*(b+1), a, b + 1));
    }

    auto [s, a, b] = pq.top(); pq.pop();

    cout << a << " " << b << ": " << s << endl;
    
    return 0;
}