UVA-11538

//#include <bits/stdc++.h>#include <vector>#include <iostream>#include <queue>#include <cmath>#include <map>#include <cstring>#include <algorithm>#include <cstdio>using namespace std;#define Riep(n) for(int i=1;i<=n;i++)#define Riop(n) for(int i=0;i<n;i++)#define Rjep(n) for(int j=1;j<=n;j++)#define Rjop(n) for(int j=0;j<n;j++)#define mst(ss,b) memset(ss,b,sizeof(ss));typedef unsigned long long LL;template<class T> void read(T&num) {    char CH; bool F=false;    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());    F && (num=-num);}int stk[70], tp;template<class T> inline void print(T p) {    if(!p) { puts("0"); return; }    while(p) stk[++ tp] = p%10, p/=10;    while(tp) putchar(stk[tp--] + '0');    putchar('\n');}const LL mod=1e9+7;const double PI=acos(-1.0);const LL inf=1e18;const int N=1e5+10;const int maxn=1005;LL n,m;int main(){        while(1)        {            read(n);read(m);            if(n==0&&m==0)break;            if(n>m)swap(n,m);            LL ans=n*m*(n+m-2);            ans+=2*(n-1)*n*(3*m-n-1)/3;            cout<<ans<<"\n";        }        return 0;}