UVA 11538 Chess Queen （数学）

ProblemAChess Queen
Input: Standard Input

Output: Standard Output

You probably know how the game of chess is played and howchess queen operates. Two chess queens are in attacking position when they areon same row, column or diagonal of a chess board. Suppose two such chess queens(one black and the other white) are placed on (2x2) chess board. They can be inattacking positions in 12 ways, these are shown in the picture below:

Given an (NxM) board you will have to decide in howmany ways 2 queens can be in attacking position in that.

Input

Input file can contain up to 5000 lines of inputs. Each linecontains two non-negative integers which denote the value ofM and N (0< M, N£10⁶) respectively.

Input is terminated by a line containing two zeroes. Thesetwo zeroes need not be processed.

Output

For each line of input produce one line of output. This linecontains an integer which denotes in how many ways two queens can be inattacking position in  an (MxN) board, where the values ofM and N came from the input. All output values will fit in 64-bit signedi