#!/usr/bin/ruby
if false
	require 'prime'
	def prime_division(n) n.prime_division end
else
	def prime_division(n)
		IO.popen('factor '+n.to_s){|io|
			a=[]
			line=io.gets
			line.split[1..-1].group_by{|e|e}.each{|k,v|a<<[k.to_i,v.size]}
			a
		}
	end
end
def divisor(a,d,n,t)
	return to_enum(:divisor,a,d,n,t) if !block_given?
	if d==a.size
		yield n,t
	else
		(0..a[d][1]).each{|i|
			divisor(
				a,d+1,
				n*pow(a[d][0],i,M),
				i==0 ? t : t*(a[d][0]-1)*pow(a[d][0],i-1,M),
				&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=prime_division(H)
B=prime_division(W)
r=0
divisor(A,0,1,1){|a,at|
	divisor(B,0,1,1){|b,bt|
		r=(r+at*bt*pow(K,W*H*a.gcd(b)/a/b,M))%M
	}
}
p r*pow(W*H,M-2,M)%M