package main

import . "fmt"
import . "math/big"

func main() {
	const Z = 1e6
	const Mod = 998244353
	ns := make([]int, Z+1)
	ds := make([]int, Z+1)
	ns[0] = 1
	for i := range ns[1:] {
		ns[i+1] = ns[i]*(i+1)%Mod
	}
	ds[Z] = int(new(Int).ModInverse(NewInt(int64(ns[Z])), NewInt(Mod)).Int64())
	for i := range ds[1:] {
		j := Z - i
		ds[j-1] = ds[j]*j%Mod
	}
	var h,w,k int
	Scan(&h,&w,&k)
	var ans int
	for i := 1; i <= h; i++ {
		if k % i != 0 {
			continue
		}
		j := k / i
		if j < 1 || w < j {
			continue
		}
		hh := ns[h]*ds[h-i]%Mod*ds[i]%Mod
		ww := ns[w]*ds[w-j]%Mod*ds[j]%Mod
		ans += hh*ww%Mod
		ans %= Mod
	}
	Println(ans)
}