def comb(n, k)
  if(n < 0)
    return 0
  else
    a = 1
    for i in 1...k
      a = a * (n - i + 1) / i
    end
    return a
  end
end

n, m, r = gets.split.map(&:to_i)
puts comb(r - n * m + n - 1, n)