SOJ-1013

/******************************************************************************************************
 ** Copyright (C) 2011.05.01 - 2013.07.01
 ** Author: famousDT <[email protected]>
 ** Edit date: 2011-04-25
******************************************************************************************************/
#include <stdio.h>
#include <stdlib.h>//abs,atof(string to float),atoi,atol,atoll
#include <math.h>//atan,acos,asin,atan2(a,b)(a/b atan),ceil,floor,cos,exp(x)(e^x),fabs,log(for E),log10
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <string.h>//memcpy(to,from,count
#include <ctype.h>//character process:isalpha,isdigit,islower,tolower,isblank,iscntrl,isprint
#include <algorithm>
using namespace std;

typedef long long int ll;

#define PI acos(-1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MALLOC(n, type) ((type *)malloc((n) * sizeof(type)))
#define FABS(a) ((a) >= 0 ? (a) : (-(a)))

int main()
{
    ll a, b;
    while (cin>>a>>b && (a || b)) {
        ll i, j;
        ll ans = 1;
        ll flag = 0;
        for (i = 2; ; ++i) {
            ans = 1;
            ll h = 0;
            while (ans != a) {
                ans *= i;
                ++h;
                if (ans > a)
                    break;
            }
            if (ans == a) {
                if (pow(i - 1, h) == b) {
                    ll sumh = 0;
                    ll num = 0;
                    ll initsum = 1;
                    ll inith = a;
                    for (j = 1; j <= h; ++j) {
                        sumh += initsum * inith;
                        num += initsum;
                        initsum *= i - 1;
                        inith /= i;
                    }
                    sumh += initsum * inith;
                    printf("%lld %lld\n", num, sumh);
                    flag = 1;
                    break;
                }                
            }
        }
    }
    return 0;
}