uva 11538 Chess Queen

#include <iostream>

using namespace std;
int main()
{
long long n,m;
while(cin>>n>>m&&(n+m))
{
if(n>m)
swap(n,m);
long long count=2*n*(n-1)*(3*m-n-1)/3;
count+=m*n*(n-1)+n*m*(m-1);
cout<<count<<endl;
}
return 0;
}