MOD = 1000003

def mypow(a,m)
#	return a**m % MOD if m < 4
	c ,res = a, 1
	while(m>0);res = res * c % MOD if m.odd?;c, m = c * c % MOD, m >> 1;end
	return res
end

def modinv(a) mypow(a, MOD-2) end
	
r = 1 ;fac = 1.upto(MOD).map { |x| r = r * x % MOD }.unshift(1)
finv = []; finv[MOD-1] = MOD - 1;
(MOD-2).downto(0) { |i| finv[i] = finv[i+1] * (i+1) % MOD}

gets
$<.read.split.map(&:to_i).each_slice(3) do |x,d,n|
	if MOD <= n - 1 + a = modinv(d) * x % MOD or x.zero? 
		p 0
	elsif d.zero?
		p mypow(x,n)
	else
		p fac[a+n-1] * finv[a] % MOD * x % MOD * mypow(d,n-1) % MOD
	end
end


