import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
from heapq import heapify, heappop, _heapify_max, heappush
from bisect import bisect_left, bisect_right
import math
import itertools
import copy

stdin=sys.stdin
#sys.setrecursionlimit(10 ** 7)
## import pypyjit
## pypyjit.set_param('max_unroll_recursion=-1')

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
mod = 10 ** 9 + 7
mod = 998244353
eps = 1e-9
sortkey1 = itemgetter(0)
sortkey2 = lambda x: (x[0], x[1])



###############################################################

A, B, S = lp()
ans = 0
acc = [0 for _ in range(S + 5)]
for i in range(1, S + 1):
    if A >= i:
        x = A - i + 1
    else:
        x = 0
    acc[i] += acc[i - 1] + x

for i in range(1, S + 1):
    if B < i:
        break
    x = B - i + 1
    y = acc[S // i]
    ans += x * y
print(ans)