C++ :

#include<iostream>
using namespace std;
int main()
{
  int n,m;
  cin>>m>>n;
  int m1=m,n1=n,s1=m*n;                        //计算正方形的个数s1
  while (m1!=0&&n1!=0)
   {
      m1--;n1--;
      s1+=m1*n1;  
   }
  int s2=((m+1)*(n+1)*m*n)/4-s1;             // 计算长方形的个数s2
  cout<<s1<<" "<<s2<<endl; 
}

Pascal :

var s1,s2,s3,s4,x,z,i,n,m:longint;
begin
read(n,m);
for i:=1 to n do
begin
s1:=n-i+1;
s2:=m-i+1;
x:=x+s1*s2;
end;
for i:=1 to n do
s3:=s3+i;
for i:=1 to m do
s4:=s4+i;
z:=s3*s4-x;
write(x,' ',z);
end.

Java :

import java.util.Scanner;

public class Main {
    static int sq(int m, int n) {
    	int min = Math.min(m, n);
    	int max = Math.max(m, n);
    	int i,k=0;
    	for(i=1;i<=min;i++) {
    		k = k + (max-(i-1))*(min-(i-1));
    	}
    	return k;
    }
    
    static int rc(int m, int n) {
    	int i,j,k=0;
    	for(i=1;i<=m;i++) {
    		for(j=1;j<=n;j++) {
    			if(i!=j) k = k + (m-(i-1))*(n-(j-1));
    		}
    	}
    	return k;
    }

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int M=sc.nextInt(),N=sc.nextInt();
		System.out.print(sq(M,N)+" "+rc(M,N));
		sc.close();

	}

}