#include 
#include 
#include 
using namespace std;
typedef long long ll;

const int N = 100000+5;
int pri[N], mu[N], pnum, presum[N];
ll presum2[N];
bool vis[N];

void mobius(int n) {
    mu[1] = 1; pnum = 0;
    for(int i = 2;i <= n; i++) {
        if(!vis[i]) {
            pri[pnum++] = i;
            mu[i] = -1;
        }
        for(int j = 0;j < pnum; j++) {
            if(i*pri[j] > n)    break;
            vis[i*pri[j]] = 1;
            if(i%pri[j] == 0) {
                mu[i*pri[j]] = 0;
                break;
            }
            mu[i*pri[j]] = -mu[i];
        }
    }
    for(int i = 1;i <= n; i++) {
        presum2[i] = presum2[i-1] + i*mu[i];
    }
    for(int i = 1;i <= n; i++)  presum[i] = presum[i-1]+mu[i];
}

int n, m;

bool input() {
    return scanf("%d%d", &n, &m) == 2;
}

void solve() {
    int top = min(n, m);
    ll ans = 0, ansx = 0, ansy = 0;
    for(int i = 1;i <= top; i++) {
        int tmp1 = n/i, tmp2 = m/i;
        int nxt = min(n/tmp1, m/tmp2);
        //printf("i = %d tmp1 = %d tmp2 = %d nxt = %d\n", i, tmp1, tmp2, nxt);
        ans += (ll)(n/i)*(m/i)*(presum[nxt]-presum[i-1]);
        ansx += (ll)m/i*(n/i + (ll)n/i*(n/i))/2*(presum2[nxt] - presum2[i-1]);
        ansy += (ll)n/i*(m/i + (ll)m/i*(m/i))/2*(presum2[nxt] - presum2[i-1]);
        i = nxt;
    }
    printf("%lld %lld %lld\n", ans, ansx, ansy);
}

int main() {
    mobius(100000);
    while(input()) {
        solve();
    }
    return 0;
}