#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
constexpr int mod2 = 998244353;
template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return (a > b && (a = b, true)); }
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return (a < b && (a = b, true)); }

template<typename T>
vector<T> makeVector(size_t a, T b) { return (vector<T>(a, b)); }
template<typename... Ts>
auto makeVector(size_t a, Ts... ts) { 
	return (vector<decltype(makeVector(ts...))>(a, makeVector(ts...)));
}

template<typename T>
bool isin(T y, T x, T h, T w) { return (0 <= y && 0 <= x && y < h && x < w); }
template<typename T>
bool isin1(T y, T x, T h, T w) { return (0 < y && 0 < x && y <= h && x <= w); }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	os << v[0];
	for (int i = 1; i < v.size(); i++) os << " " << v[i];
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u;
	return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}


template<unsigned MOD>
struct Modint {
	using uint = unsigned;
	using u64 = uint64_t;
	using i64 = int64_t;

	Modint (const i64 dat = 0) : dat(dat >= 0 ? dat % MOD : (MOD - (-dat) % MOD) % MOD) {}

	constexpr Modint operator + (const Modint &v) const { return (Modint(*this) += v); }
	constexpr Modint operator - () const { return (Modint(-((i64)dat))); }
	constexpr Modint operator - (const Modint &v) const { return (Modint(*this) -= v); }
	constexpr Modint operator * (const Modint &v) const { return (Modint(*this) *= v); }

	constexpr Modint &operator = (const i64 &v) { return ((*this) = Modint<MOD>(v)); }
	constexpr Modint &operator += (const Modint &v) {
		dat += v.dat;
		if (dat >= MOD) dat -= MOD;
		return (*this);
	}
	constexpr Modint &operator -= (const Modint &v) {
		if (dat < v.dat) dat += MOD;
		dat -= v.dat;
		return (*this);
	}
	constexpr Modint &operator *= (const Modint &v) {
		dat = dat * v.dat % MOD;
		return (*this);
	}

	constexpr Modint operator ~ () const {
		i64 a = dat, b = MOD, x1 = 1, x2 = 0, t;

		while (b > 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(x1 -= t * x2, x2);
		}

		return (Modint(x1));
	}

	constexpr Modint operator / (const Modint &v) const { return ((*this) * ~v); }
	constexpr Modint &operator /= (const Modint &v) { return ((*this) = (*this) / v); }

	constexpr Modint operator ^ (u64 n) const {
		Modint<MOD> ret(1), mul(dat);
		while (n > 0) {
			if (n & 1) ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return (ret);
	}

	bool operator == (const Modint &v) { return (dat == v.dat); }
	bool operator != (const Modint &v) { return (dat != v.dat); }

	friend ostream& operator << (ostream &os, const Modint &p) {
		return (os << p.dat);
	}

	friend istream& operator >> (istream &is, Modint &p) {
		i64 data;
		is >> data;
		p = Modint<MOD>(data);
		return (is);
	}

	u64 dat;
};

constexpr int MAX = 3010000;
constexpr int MOD = 1000003;

ll fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

ll COM(int n, int k) {
	if (n < k || n < 0 || k < 0) return (0);
	return (fac[n] * (finv[k] * finv[n - k] % MOD) % MOD);
}

ll PERM(int n, int k) {
	if (n < k || n < 0 || k < 0) return (0);
	return (fac[n] * finv[n - k] % MOD);
}


void Main() {
	int Q; cin >> Q;
	COMinit();

	for (int i = 0; i < Q; i++) {
		Modint<MOD> x, d;
		ll n; cin >> x >> d >> n;
		if (d == 0) {
			cout << (x^n) << el;
			continue;
		}
		Modint<MOD> xd = x/d;
		if (n >= 1000003 || x == 0 || (xd + n-1).dat < xd.dat) cout << 0 << el;
		else cout << (d^n) * fac[(xd + n-1).dat] * finv[(xd-1).dat] << el;
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout << fixed << setprecision(20);
	Main();
	return (0);
}


Measured memory_bytes: 74188