VTRI - Triangles

In the plane, given a rectangular grid with sides parallel to the axes of coordinates. The coordinates of the bottom-left corner is (0, 0) and the top-right corner is (X, Y).

Your task is to count the number of triangles with integer coordinates lying inside the given grid and having areas equal to an integer S.

Input

A single line consisting of three integers: X, Y, S (1 ≤ X, Y ≤ 30, 1 ≤ S ≤ X*Y/2).

Output

A single integer: the number of triangles with integer coordinates lying inside the rectanglular grid and having areas equal to S.

Constraint

There are 50% of the test cases, corresponding to 50% of the grades, in which 1≤X, Y≤10.

Example

Input
2 1 1	

Output
6 


Được gửi lên bởi:Jimmy
Ngày:2008-04-19
Thời gian chạy:1s
Giới hạn mã nguồn:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Ngôn ngữ cho phép:Tất cả ngoại trừ: ERL GOSU JS-RHINO NODEJS PERL6 PYPY RUST SED VB.NET
Nguồn bài:VNOI Marathon '08 - Round 1/DivA
Problem Setter: Ngô Minh Đức

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.