#描述#
We all love recursion! Don't we? <br>
Consider a three-parameter recursive function w(a, b, c): <br>
if a <= 0 or b <= 0 or c <= 0, <br>
then w(a, b, c) returns: 1 <br>
<br>
if a > 20 or b > 20 or c > 20, <br>
then w(a, b, c) returns: w(20, 20, 20) <br>
<br>
if a < b and b < c, <br>
then w(a, b, c) returns: w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c) <br>
<br>
otherwise it returns: w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1,
b-1, c-1) <br>
<br>
This is an easy function to implement. The problem is, if implemented directly,
for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the
program takes hours to run because of the massive recursion. <br>

#格式#
##输入格式##
The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.

##输出格式##
Print the value for w(a,b,c) for each triple.

#样例1#
##样例输入1##

1 1 1
2 2 2
10 4 6
50 50 50
-1 7 18
-1 -1 -1

##样例输出1##

w(1, 1, 1) = 2
w(2, 2, 2) = 4
w(10, 4, 6) = 523
w(50, 50, 50) = 1048576
w(-1, 7, 18) = 1

#限制#
1000ms
32768KB

#提示#

#来源#