#!/usr/bin/ruby
require 'prime'
class Integer
	def totient()    self.prime_division.reduce(1){|s,(n,p)|s*(n-1)*n**(p-1)} end
end
def divisor(a,d,n)
	return to_enum(:divisor,a,d,n) if !block_given?
	if d==a.size
		yield n
	else
		(0..a[d][1]).each{|i|
			divisor(a,d+1,n*a[d][0]**i,&proc)
		}
	end
end
def pow(x,y,m)
	z=1
	while y>0
		z=z*x%m if y%2>0
		x=x*x%m
		y/=2
	end
	z
end

M=1000000007
H,W,K=gets.split.map(&:to_i)
A=H.prime_division
B=W.prime_division
r=0
divisor(A,0,1){|a|
	divisor(B,0,1){|b|
		r+=a.totient*b.totient*pow(K,W*H*a.gcd(b)/a/b,M)
	}
}
p r*pow(W*H,M-2,M)%M