QWQ

#include<iostream>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    unsigned long long o=0;
    for(int i=0;i<min(n,m);i++){
        o+=(n-i)*(m-i);
    }
    unsigned long long p=((n*(n+1))/2)*((m*(m+1)))/2;
    cout<<o<<' '<<p-o;
}